Compositional Failure Detection in Structured Transition Systems
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.
Keywordsmodel-checking finitely synchronized products compositional failure detection
Unable to display preview. Download preview PDF.
- 3.Bodentien, N.O., Vestergaard, J., Friis, J., Kristoffersen, K.J., Larsen, K.G.: Verification of state/event systems by quotienting. BRICS RS-99-41 (December 1999) Nordic Workshop in Programming Theory, Uppsala, Sweden, October 6–8 (1999)Google Scholar
- 11.Felscher, I., Thomas, W.: On compositional failure detection in structured transition systems, RWTH Aachen Unviersity, Department of Computer Science, Tech. Rep.AIB-2011-12Google Scholar
- 13.Hodges, W.: Model theory, Encyclopedia of Mathematics and its Applications, vol. 42. Cambridge University Press, Cambridge (1993)Google Scholar
- 16.Rabinovich, A.: On compositionality and its limitations. ACM Transactions on Computational Logic 8(1) (January 2007)Google Scholar
- 20.Wöhrle, S., Thomas, W.: Model checking synchronized products of infinite transition systems. In: Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science. LNCS, pp. 2–11. IEEE Computer Society Press, Los Alamitos (2004)Google Scholar