Abstract
Compositional generation is an incremental technique for generating a reduced labelled transition system representing the behaviour of a set of communicating processes. In particular, since intermediate reductions can be performed after each generation step, the size of the Lts can be kept small and state-explosion can be avoided in many cases. This paper deals with compositional generation in presence of asynchronous communications via shared buffers. More precisely, we show how partial-order reduction techniques can be used in this context to define equivalence relations: that preserve useful properties, are congruence w.r.t asynchronous composition, and rely on a (syntactic) notion of preorder on execution sequences characterizing their “executability” in any buffer environment. Two such equivalences are proposed, together with dedicated asynchronous composition operators able to directly produce reduced Lts.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
P. Abdulla, B. Jonsson, M. Kindhal, and D. Peled. A General Approach to Partial Order Reductions in Symbolic Verification. In Proceedings of CAV’98, Vancouver, Canada, volume 1427 of LNCS, June 1998. 268
BFG+91._Ahmed Bouajjani, Jean-Claude Fernandez, Susanne Graf, Carlos Rodríguez, and Joseph Sifakis. Safety for Branching Time Semantics. In Proceedings of 18th ICALP. Springer Verlag, July 1991. 270
BFG+99._M. Bozga, J.-C. Fernandez, L. Ghirvu, S. Graf, J.P. Krimm, and L. Mounier. IF: An Intermediate Representation and Validation Environment for Timed Asynchronous Systems. In Proceedings of FM’99, Toulouse, France, LNCS 1708, 1999. 281
S.C. Cheung and J. Kramer. Enhancing Compositional Reachability Analysis with Context Constraints. In Proceedings of the 1st ACM International Symposium on the Foundations of Software Engineering, pages 115–125, Los Angeles, California, December 1993. 267
S. Graf and B. Steffen. Compositional Minimization of Finite State Processes. In Workshop on Computer-Aided Verification, Rutgers, USA, June 1990. DIMACS, R.P. Kurshan and E.M. Clarke. 267
P. Godefroid and P. Wolper. Using Partial Orders for the Efficient Verification of Deadlock Freedom and Safety Properties. In K. G. Larsen, editor, Proceedings of CAV’91 (Aalborg, Denmark), July 1991. 267
C. A. R. Hoare. Communicating Sequential Processes. Prentice-Hall, 1985. 267
Gerard J. Holzmann. Design and Validation of Computer Protocols. Software Series. Prentice Hall, 1991. 267, 281
ISO/ IEC. LOTOS — A Formal Description Technique Based on the Temporal Ordering of Observational Behaviour. Information Processing Systems — OSI, Genève, July 1987. 267
ITU-T. Specification and Description Language (SDL). ITU-T Recommendation Z.100, International Telecommunication Union, Genève, 1992. 267
KLM+98._R. Kurshan, V. Levin, M. Minea, D. Peled, and H. Yenigün. Static Partial Order Reduction. In Proceedings of TACAS’98, Lisbon, Portugal, volume 1384 of LNCS, 1998. 267
Jean-Pierre Krimm and Laurent Mounier. Compositional State Space Generation from Lotos Programs. In Ed Brinksma, editor, Proceedings of TACAS’97, Enschede, The Netherlands, April 1997. Springer Verlag. 267
S. Katz and D. Peled. Defining conditional independence usin collapses. Theoretical Computer Science, 101(1):337–359, 1992. 281
Lipton. Reduction, a method of proving properties of parallel programs. Communications of the ACM, 18(12):717–721, dec 1975. 268
Robin Milner. Communication and Concurrency. Prentice-Hall, 1989. 270
Doron Peled. Combining partial-order reductions with on-the-fly model-checking. Formal Methods in System Design, 8:39–64, 1996. 267
A. Valmari. A Stubborn Attack on State Explosion. In Workshop on Computer-Aided Verification, Rutgers, USA, June 1990. DIMACS, R.P. Kurshan and E.M. Clarke. 267
Antti Valmari. Compositionality in State Space Verification. In Application and Theory of Petri Nets, volume 1091 of LNCS, pages 29–56, Springer Verlag, June 1996. 267
R. J. van Glabbeek and W. P. Weijland. Branching-Time and Abstraction in Bisimulation Semantics (extended abstract). CS R8911, Centrum voor Wiskunde en Informatica, Amsterdam, 1989. 270
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Krimm, JP., Mounier, L. (2000). Compositional State Space Generation with Partial Order Reductions for Asynchronous Communicating Systems. In: Graf, S., Schwartzbach, M. (eds) Tools and Algorithms for the Construction and Analysis of Systems. TACAS 2000. Lecture Notes in Computer Science, vol 1785. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46419-0_19
Download citation
DOI: https://doi.org/10.1007/3-540-46419-0_19
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67282-1
Online ISBN: 978-3-540-46419-8
eBook Packages: Springer Book Archive