Abstract
Reinforcement learning algorithms discover policies that
maximize reward. However, these policies generally do not adhere to
safety, leaving safety in reinforcement learning (and in artificial intelligence in general) an open research problem. Shield synthesis is a formal
approach to synthesize a correct-by-construction reactive system called a
shield that enforces safety properties of a running system while interfering with its operation as little as possible. A shield attached to a learning
agent guarantees safety during learning and execution phases. In this
paper we summarize three types of shields that are synthesized from
different specification languages, and discuss their applicability to reinforcement learning. First, we discuss deterministic shields that enforce
specifications expressed as linear temporal logic specifications. Second,
we discuss the synthesis of probabilistic shields from specifications in
probabilistic temporal logic. Third, we discuss how to synthesize timed
shields from timed automata specifications. This paper summarizes the
application areas, advantages, disadvantages and synthesis approaches
for the three types of shields and gives an overview of experimental
results.
maximize reward. However, these policies generally do not adhere to
safety, leaving safety in reinforcement learning (and in artificial intelligence in general) an open research problem. Shield synthesis is a formal
approach to synthesize a correct-by-construction reactive system called a
shield that enforces safety properties of a running system while interfering with its operation as little as possible. A shield attached to a learning
agent guarantees safety during learning and execution phases. In this
paper we summarize three types of shields that are synthesized from
different specification languages, and discuss their applicability to reinforcement learning. First, we discuss deterministic shields that enforce
specifications expressed as linear temporal logic specifications. Second,
we discuss the synthesis of probabilistic shields from specifications in
probabilistic temporal logic. Third, we discuss how to synthesize timed
shields from timed automata specifications. This paper summarizes the
application areas, advantages, disadvantages and synthesis approaches
for the three types of shields and gives an overview of experimental
results.
Original language | English |
---|---|
Title of host publication | Leveraging Applications of Formal Methods, Verification and Validation |
Subtitle of host publication | Verification Principles - 9th International Symposium on Leveraging Applications of Formal Methods, ISoLA 2020, Proceedings |
Editors | Tiziana Margaria, Bernhard Steffen |
Pages | 290-306 |
Number of pages | 17 |
Volume | 1 |
DOIs | |
Publication status | E-pub ahead of print - 29 Oct 2020 |
Event | 2020 International Symposium on Leveraging Applications of Formal Methods - Virtuell, Greece Duration: 26 Oct 2020 → 30 Oct 2020 |
Publication series
Name | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
---|---|
Volume | 12476 LNCS |
ISSN (Print) | 0302-9743 |
ISSN (Electronic) | 1611-3349 |
Conference
Conference | 2020 International Symposium on Leveraging Applications of Formal Methods |
---|---|
Abbreviated title | ISoLA 2020 |
Country/Territory | Greece |
City | Virtuell |
Period | 26/10/20 → 30/10/20 |
ASJC Scopus subject areas
- Theoretical Computer Science
- Computer Science(all)