Abstract
Model checking is an automatic technique for verifying finite state systems: in this approach, properties are expressed in a temporal logic and systems are modelled as transition systems. A main problem of model checking is state explosion: very complex systems are often represented by transition systems with a prohibitive number of states. The primary cause of this problem is the parallel composition of interacting processes. Many techniques have been proposed to attack this problem, among them compositional techniques. These techniques reduce state explosion exploiting the natural decomposition of complex systems into processes. In this paper we present a formula-based compositional rule that allows us to deduce a property of a parallel composition of processes by checking it only on a component process.
The original version of this chapter was revised: The copyright line was incorrect. This has been corrected. The Erratum to this chapter is available at DOI: 10.1007/978-0-387-35533-7_26
Chapter PDF
Similar content being viewed by others
References
H.R. Andersen, G. Winskel. Compositional Checking of Satisfaction. Formal Methods in System Design, 1(4), 1992.
R. Barbuti, N. De Francesco, A. Santone, G. Vaglini. Selective Mu-Calculus: New Modal Operators for Proving Properties on Reduced Transition Systems. In Proceedings of FORTE X/PSTV XVII ‘87. Chapman & Hall, 1997. 519–534
R. Barbuti, N. De Francesco, A. Santone, G. Vaglini. Selective Mu-Calculus and Formula-Based Abstractions of Transition Systems. Journal of Computer and System Sciences, 59(3), 1999. 537–556.
T. Bolognesi, E. Brinksma. Introduction to ISO Specification Language LOTOS. Comp. Networks and ISDN Systems, 14, 1987. 2559.
A. Bouali, S. Gnesi, S. Larosa. The integration Project for the JACK Environment. Bulletin of the EATCS, 54, 1994. 207–223.
J. Burch, E. Clarke, K. McMillan, D. Dill, L. Hwang. Symbolic Model Checking: 1020 States and Beyond. In Proceedings of Fifth Annual IEEE Symposium on Logic in Computer Science,1990. 428–439.
E.M. Clarke, O.Grumberg, D.E. Long. Model Checking and Abstraction. ACM Transactions on Programming Languages and Systems, 16(5), 1994. 1512–1542.
E.M. Clarke, D.E. Long, K.L. McMillan. Compositional Model Checking. In Proceedings of the Fourth Annual IEEE Symposium on Logic in Computer Science, 1989. 353–362.
R. Cleveland. Tableau-based Model Checking in the Propositional Mu-Calculus. Acta Informatica, 27, 1990. 725–747.
R. Cleaveland, S. Sims. The NCSU Concurrency Workbench. In Proceedings of the Eighth International Conference on Computer-Aided Verification (CAV’96), Lecture Notes in Computer Science 1102, 1996. 394–397.
E.A. Emerson, J.Y. Halpern. “Sometimes” and “Not Never” Revisited: On Branching Time Versus Linear Time. Journal of ACM, 33 (1), 1986. 151–178.
J.C. Fernandez, L. Mounier. Verifying Bisimulation on the fly. In Proceedings of the Third International Conference on Formal Description Techniques, FORTE’90, 1990.
Grumberg, D.E. Long. Model Checking and Modular Verification. ACM Transactions on Programming Languages and Systems, 16 (3), 1994. 843–871.
C. Jard, T. Jéron. Bounded-memory Algorithms for Verification on-the-fly. In Proceedings of the Third International Conference on Computer-Aided Verification (CAV’91), Lecture Notes in Computer Science 575, 1991. 192–201.
R. Kaivola. Compositional Model Checking for Linear-Time Temporal Logic. In Proceedings of the Fourth International Conference on Computer-Aided Verification (CAV’92), Lecture Notes in Computer Science 663, 1991. 248–259.
D. Kozen. Results on the Propositional Mu-Calculus. Theoretical Computer Science, 27, 1983. 333–354.
E. Madelaine, D. Vergamini. Finiteness Conditions and Structural Construction of Automata for all Process Algebras. In Proceedings of 2nd Workshop on Computer-Aided Verification. DIMACS Technical Report 90–31, 1990.
K. McMillan. Symbolic Model Checking. Boston: Kluwer Academic Publishers, 1993.
R. Milner. Communication and Concurrency. Prentice-Hall, 1989.
R. Paige, R. Tarjan. Three Partition Refinement Algorithms. SIAM Journal of Computing, 16(6), 1987. 973–989.
A. Pnueli. In Transition for Global to Modular Temporal Reasoning about Programs Logics and Models of Concurrent Systems. NATO ASI Series. Series F, Computer and System Sciences, 13. Springer-Verlag, 1984.
C. Stirling. An Introduction to Modal and Temporal Logics for CCS. In Concurrency: Theory, Language, and Architecture, Lecture Notes in Computer Science 391, 1989.
C. Stirling, D. Walker. Local Model Checking in the Modal Mu-Calculus. Theoretical Computer Science, 89, 1991. 161–177.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 IFIP International Federation for Information Processing
About this chapter
Cite this chapter
Santone, A. (2000). Compositionality for Improving Model Checking. In: Bolognesi, T., Latella, D. (eds) Formal Methods for Distributed System Development. PSTV FORTE 2000 2000. IFIP — The International Federation for Information Processing, vol 55. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-35533-7_7
Download citation
DOI: https://doi.org/10.1007/978-0-387-35533-7_7
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4757-5264-9
Online ISBN: 978-0-387-35533-7
eBook Packages: Springer Book Archive