Computer Science – Formal Languages and Automata Theory
Scientific paper
2011-06-07
EPTCS 54, 2011, pp. 178-191
Computer Science
Formal Languages and Automata Theory
In Proceedings GandALF 2011, arXiv:1106.0814
Scientific paper
10.4204/EPTCS.54.13
The distinction between safety and liveness properties is a fundamental classification with immediate implications on the feasibility and complexity of various monitoring, model checking, and synthesis problems. In this paper, we revisit the notion of safety for reactive systems, i.e., for systems whose behavior is characterized by the interplay of uncontrolled environment inputs and controlled system outputs. We show that reactive safety is a strictly larger class of properties than standard safety. We provide algorithms for checking if a property, given as a temporal formula or as a word or tree automaton, is a reactive safety property and for translating such properties into safety automata. Based on this construction, the standard verification and synthesis algorithms for safety properties immediately extend to the larger class of reactive safety.
Ehlers Rüdiger
Finkbeiner Bernd
No associations
LandOfFree
Reactive Safety does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Reactive Safety, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Reactive Safety will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-26172