On-the-fly state space reductions for weak equivalences

FMICS'05 - Proceedings of the Tenth International Workshop on Formal Methods for Industrial Critical Systems

Volumn , Issue , 2005, Pages 80-89

  Mateescu, Radu ^a  

^a INRIA RHÔNE ALPES   (France)

Author keywords

Bisimulation; Equivalence checking; Graph exploration; Labeled transition system; Model checking; Mu calculus; Partial order reduction

Indexed keywords

ALGORITHMS; DIFFERENTIATION (CALCULUS); ERROR DETECTION; FINITE AUTOMATA; GRAPH THEORY; MATHEMATICAL MODELS;

BISIMULATION; EQUIVALENCE CHECKING; GRAPH EXPLORATION; LABELED TRANSITION SYSTEMS (LTS); PARTIAL ORDER REDUCTION;

CONCURRENT ENGINEERING;

EID: 33749011710     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1081180.1081191     Document Type: Conference Paper

References (26)

1. R. Barbuti, N. de Francesco, A. Santone, and G. Vaglini. Selective mu-calculus and formula-based equivalence of transition systems. Journal of Computer and System Sciences, 59(3):537-556, 1999.
2. D. Bergamini, N. Descoubes, C. Joubert, and R. Mateescu. Bisimulator: a modular tool for on-the-fly equivalence checking. In N. Halbwachs and L. Zuck, editors, Proc. of TAC AS'2005, LNCS vol. 3440, pp. 581-585. Springer Verlag, April 2005.
3. S. Blom and J. van de Pol. State space reduction by proving confluence. In E. Brinksma and K. G. Larsen, editors, Proc. of CAV'02, LNCS vol. 2404, pp. 596-609. Springer Verlag, July 2002.
4. A. Bouajjani, J.-C. Fernandez, S. Graf, C. Rodríguez, and J. Sifakis. Safety for branching time semantics. In Proc. of ICALP'91, LNCS vol. 510, pp. 76-92. Springer Verlag, 1991.
5. R. De Nicola and F. W. Vaandrager. Action versus state based logics for transition systems. In I. Guessarian, editor, Semantics of Systems of Concurrent Processes, LNCS vol. 469, pp. 407-419. Springer Verlag, April 1990.
6. J.-C. Fernandez and L. Mounier. "On the Fly" verification of behavioural equivalences and preorders. In K. G. Larsen and A. Skou, editors, Proc. of CAV'91 (Aalborg, Denmark), LNCS vol. 575. Springer Verlag, 1991.
7. M. J. Fischer and R. E. Ladner. Prepositional dynamic logic of regular programs. Journal of Computer and System Sciences 18(2):194-211, 1979.
8. H. Garavel. Open/Cæsar: an open software architecture for verification, simulation, and testing. In B. Steffen, editor, Proc. of TACAS'98, LNCS vol. 1384, pp. 68-84. Springer Verlag, March 1998.
9. H. Garavel, F. Lang, and R. Mateescu. An overview of CADP 2001. European Association for Software Science and Technology (EASST) Newsletter, 4, 2002.
10. P. Godefroid. Partial-order methods for the verification of concurrent systems - an approach to the state-explosion problem, LNCS vol. 1032. Springer Verlag, January 1996.
11. J. F. Groote and M. P. A. Sellink. Confluence for process verification. Theoretical Computer Science, 170(1-2);47-81, 1996.
12. J. F. Groote and J. van de Pol. State space reduction using partial τ-confluence. In M. Nielsen and B. Rovan, editors, Proc. of MFCS'00, LNCS vol. 1893, pp. 383-393. Springer Verlag, August 2000.
13. Y. Ioannidis, R. Ramakrishnan, and L. Winger. Transitive closure algorithms based on graph traversal. ACM Tr. on Database Systems, 18(3):512-576, 1993.
14. T. Jéron and P. Morel. Test generation derived from model-checking. In N. Halbwachs and D. Peled, editors, Proc. CAV'99, LNCS vol. 1633, pp. 108-122. Springer Verlag, July 1999.
15. T. Jéron and P. Morel. Abstraction, τ-réduction et déterminisation à la volée: application à la génération de test. In G. Leduc, editor, Congrès Francophone sur l'Ingéniérie des Protocoles CFIP'97. Hermès, 1997.
16. J. Magee and J. Kramer. Concurrency - state models and Java programs. John Wiley and Sons, 1999.
17. R. Mateescu. A generic on-the-fly solver for alternation-free boolean equation systems. In H. Garavel and J. Hatcliff, editors, Proc. of TACAS'2003, LNCS vol. 2619, pp. 81-96. Springer Verlag, April 2003.
18. R. Mateescu and M. Sighireanu. Efficient on-the-fly model-checking for regular alternation-free mu-calculus. Science of Computer Programming, 46(3):255-281, March 2003.
19. R. Milner. Communication and concurrency. Prentice-Hall, 1989.
20. G. Pace, F. Lang, and R. Mateescu. Calculating τ-confluence compositionally. In Jr W. A. Hunt and F. Somenzi, editors, Proc. of CAV2003, LNCS vol. 2725, pp. 446-459. Springer Verlag, July: 2003.
21. Y. S. Ramakrishna and S. A. Smolka. Partial-order reduction in the weak modal mu-calculus. In A. Mazurkiewicz and J. Winkowski, editors, Proc. of CON CUR'97, LNCS vol. 1243, pp. 5-24. Springer Verlag, July 1997.
22. C. Stirling. Modal and temporal properties of processes. Springer Verlag, 2001.
23. R. E. Tarjan. Depth first search and linear graph algorithms. SIAM Journal of Computing, 1(2):146-160, 1972.
24. A. Valmari, J. Kemppainen, M. Clegg, and M. Levanto. Putting advanced reachability analysis techniques together: the "ARA" tool. In J. Woodcock and P. G. Larsen, editors, Proc. of FME'93, LNCS vol. 670, pp. 597-616. Springer Verlag, April 1993.
25. Vasy team. VLTS benchmark suite, http://www.inrialpes.fr/vasy/cadp/ resources/benchmark_bcg.html, March 2003.
26. R. J. van Glabbeek and W. P. Weijland. Branching-time and abstraction in bisimulation semantics. CS R8911, Amsterdam, 1989. Also in Proc. of 11th IFIP World Computer Congress, 1989.