Proceedings ArticleDOI
Verification of reactive system specifications with outer event conditional formula
Takenobu Aoshima,N. Yonezaki +1 more
- pp 189-193
Reads0
Chats0
TLDR
An efficient tableau-based satisfiability checking procedure for a specification which consists of several modules which extracts reduced constraints from each module and verifies a property with them is introduced.Abstract:
We introduce an efficient tableau-based satisfiability checking procedure for a specification which consists of several modules. This method extracts reduced constraints from each module and verifies a property with them. We also show that this method is applicable to the decision procedure for strong satisfiability and stepwise satisfiability. Finally, we show the experimental results of the method.read more
Citations
More filters
Journal ArticleDOI
Safraless LTL synthesis considering maximal realizability
Takashi Tomita,Takashi Tomita,Atsushi Ueno,Masaya Shimakawa,Shigeki Hagihara,Naoki Yonezaki,Naoki Yonezaki,Naoki Yonezaki +7 more
TL;DR: This paper proposes a method for synthesizing a reactive system that realizes all must specifications and strongly endeavors to satisfy each desirable specification, and applies the Safraless approach to construct safety games from given must and desirable specifications.
Proceedings ArticleDOI
Simple synthesis of reactive systems with tolerance for unexpected environmental behavior
TL;DR: This paper gives a simple definition of environmentalolerance, and proposes a method for synthesizing a reactive system with environmental tolerance, and it is confirmed that the obtained reactive systems have environmental tolerance.
Proceedings ArticleDOI
An efficient verification procedure supporting evolution of reactive system specifications
TL;DR: A verification method for checking properties of specifications described in Linear Temporal Logic, such as satisfiability, stepwise satisfiability and strong satisfiability is developed based on a tableau method using combination of Binary Decision Diagrams representing sets of states and coarse graphs representing transitions.
Proceedings ArticleDOI
Minimal strongly unsatisfiable subsets of reactive system specifications
TL;DR: This paper defines minimal strongly unsatisfiable subsets (MSUSs) to locate flaws, and construct a procedure to compute them, and confirms that MSUSs are computable for specifications of reactive systems at non-trivial scales.
Book ChapterDOI
Reducing Bounded Realizability Analysis to Reachability Checking
TL;DR: This work reduces bounded realizability checking to satisfiability modulo theories (SAT)-based reachability checking and is faster because in many cases, the result is obtained by reachability Checking of small steps.
References
More filters
Proceedings ArticleDOI
On the synthesis of a reactive module
Amir Pnueli,Roni Rosner +1 more
TL;DR: An algorithm is presented based on a new procedure for checking the emptiness of Rabin automata on infinite trees in time exponential in the number of pairs, but only polynomial in theNumber of states, which leads to a synthesis algorithm whose complexity is doubleonential in the length of the given specification.
Journal ArticleDOI
Temporal logic can be more expressive
TL;DR: It is proved that there are properties of sequences that are not expressible in temporal logic, even though they are easily expressible using, for instance, regular expressions, and shown how temporal logic can be extended to express any property definable by a right-linear grammar and hence a regular expression.
Book ChapterDOI
A New One-Pass Tableau Calculus for PLTL
TL;DR: A one-pass tableau calculus PLTLT for the propositional linear time logic PLTL is presented, which is correct and complete and unlike in previous decision methods, there is no second phase that checks for the fulfillment of the so-called eventuality formulae.
Book ChapterDOI
A Decision Algorithm for Full Propositional Temporal Logic
TL;DR: An efficient algorithm for checking the satisfiability of a propositional linear time temporal logic formula, which may have past as well as future operators, which can be used to check validity of such formulas over all models as well over computations of a finite-state program.
Book ChapterDOI
Derivation of the Input Conditional Formula from a Reactive System Specifictaion in Temporal Logic
Ryosei Mori,Naoki Yonezaki +1 more
TL;DR: An algorithm which derives the input conditional formula from a reactive system specification using propositional linear-time temporal logic as a specification language and a derivation algorithm based on the tableau method for temporal logic.