Context constraints for compositional reachability analysis
ACM Transactions on Software Engineering and Methodology (TOSEM)
Languages, automata, and logic
Handbook of formal languages, vol. 3
Constructing automata from temporal logic formulas: a tutorial
Lectures on formal methods and performance analysis
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
Ehrenfeucht Games, the Composition Method, and the Monadic Theory of Ordinal Words
Structures in Logic and Computer Science, A Selection of Essays in Honor of Andrzej Ehrenfeucht
Model Checking Synchronized Products of Infinite Transition Systems
LICS '04 Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science
On compositionality and its limitations
ACM Transactions on Computational Logic (TOCL)
Principles of Model Checking (Representation and Mind Series)
Principles of Model Checking (Representation and Mind Series)
The Compositional Method and Regular Reachability
Electronic Notes in Theoretical Computer Science (ENTCS)
Model theory makes formulas large
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
| Hi-index | 0.00 |
In model-checking, systems are often given as products. We propose an approach that is built on a preprocessing of specifications in terms of appropriate automata. This allows to incorporate information about the local behaviour and synchronization of the system components into the specification. We develop a framework of (partially) synchronized automaton products and a format of corresponding specification automata that allows for a compositional failure detection of linear regular properties (either for finite or for infinite behaviour). As a result we obtain an algorithm which separates the local and the non-local segments of system runs, resulting in improved complexity bounds in typical specifications.