Compositional state space generation with partial order reductions for asynchronous communicating systems

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1785 LNCS, Issue , 2000, Pages 266-282

  Krimm, Jean Pierre ^a   Mounier, Laurent ^a  

^a CNRS   (France)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SCIENCE; COMPUTERS; ARTIFICIAL INTELLIGENCE;

ASYNCHRONOUS COMMUNICATION; ASYNCHRONOUS COMPOSITION; COMMUNICATING PROCESS; EQUIVALENCE RELATIONS; INCREMENTAL TECHNIQUES; LABELLED TRANSITION SYSTEMS; PARTIAL ORDER REDUCTIONS; STATE-SPACE GENERATION;

ARTIFICIAL INTELLIGENCE; STATE SPACE METHODS;

EID: 84863890540     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-46419-0_19     Document Type: Conference Paper

References (19)

1. 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.
2. 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.
3. 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.
4. S.C. Cheung and J. Kramer. Enhancing Compositional Reachability Analysis with Context Constraints. In Proceedings of the 1st ACM I nternati onal Symposium on the Foundations of Software Engineering, pages 115-125, Los Angeles, California, December 1993.
5. 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.
6. 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.
7. C. A. R. Hoare. Communicating Sequential Processes. Prentice-Hall, 1985.
8. Gerard J. Holzmann. Design and Validation of Computer Protocols. Software Series. Prentice Hall, 1991.
9. ISO/IEC. LOTOS - A Formal Description Technique Based on the Temporal Ordering of Observational Behaviour. Information Processing Systems - OSI, Genève, July 1987.
10. ITU-T. Specification and Description Language (SDL). ITU-T Recommendation Z.100, International Telecommunication Union, Genève, 1992.
11. 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.
12. 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.
13. S. Katz and D. Peled. Defining conditional independence usin collapses. Theoretical Computer Science, 101(1):337-359, 1992. (Pubitemid 23626874)
14. Lipton. Reduction, a method of proving properties of parallel programs. Communications of the ACM, 18(12):717-721, dec 1975.
15. Robin Milner. Communication and Concurrency. Prentice-Hall, 1989.
16. Doron Peled. Combining partial-order reductions with on-the-fly modelchecking. Formal Methods in System Design, 8:39-64, 1996. (Pubitemid 126708449)
17. 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.
18. 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.
19. R. J. van Glabbeekand W. P. Weijland. Branching-Time and Abstraction in Bisimulation Semantics (extended abstract). CS R8911, Centrum voor Wiskunde en Informatica, Amsterdam, 1989