A general approach to comparing infinite-state systems with their finite-state specifications

Theoretical Computer Science

Volumn 358, Issue 2-3, 2006, Pages 315-333

  Kučera, Antonín ^a   Schnoebelen, Philippe ^b  

^a MASARYK UNIVERSITY   (Czech Republic)

^b CNRS   (France)

Author keywords

Infinite state systems; Modal logic; Semantic equivalences; Verification

Indexed keywords

EQUIVALENCE CLASSES; FORMAL LOGIC; MATHEMATICAL MODELS; MODAL ANALYSIS; PROBLEM SOLVING; SEMANTICS;

INFINITE-STATE SYSTEMS; MODAL LOGIC; SEMANTIC EQUIVALENCES; VERIFICATION;

FINITE AUTOMATA;

EID: 33746276514     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2006.01.021     Document Type: Article

References (40)

1. Abdulla P.A., Čerāns K., Jonsson B., and Tsay Y.-K. Algorithmic analysis of programs with well quasi-ordered domains. Inform. and Comput. 160 1-2 (2000) 109-127
2. Abdulla P.A., and Jonsson B. Verifying programs with unreliable channels. Inform. and Comput. 127 2 (1996) 91-101
3. Baeten J.C.M., Bergstra J.A., and Klop J.W. Decidability of bisimulation equivalence for processes generating context-free languages. J. Assoc. Comput. Mach. 40 3 (1993) 653-682
4. J.C.M. Baeten, R.J. van Glabbeek, Another look at abstraction in process algebra, in: Proc. ICALP'87, Lecture Notes in Computer Science, Vol. 267, Springer, Berlin, 1987, pp. 84-94
5. A. Bouajjani, Languages, rewriting systems, and verification of infinite-state systems, in: Proc. ICALP'2001, Lecture Notes in Computer Science, Vol. 2076, Springer, Berlin, 2001, pp. 24-39.
6. A. Bouajjani, R. Mayr, Model-checking lossy vector addition systems, in: Proc. STACS'99, Lecture Notes in Computer Science, Vol. 1563, Springer, Berlin, 1999, pp. 323-333.
7. Brand D., and Zafiropulo P. On communicating finite-state machines. J. Assoc. Comput. Mach. 30 2 (1983) 323-342
8. Browne M.C., Clarke E.M., and Grumberg O. Characterizing finite Kripke structures in propositional temporal logic. Theoret. Comput. Sci. 59 1-2 (1988) 115-131
9. O. Burkart, D. Caucal, F. Moller, B. Steffen, Verification on infinite structures, Handbook of Process Algebra, 1999, pp. 545-623.
10. de Nicola R., and Vaandrager F. Three logics for branching bisimulation. J. Assoc. Comput. Mach. 42 2 (1995) 458-487
11. Esparza J., and Nielsen M. Decidability issues for Petri nets-a survey. J. Inform. Process. Cybernet. 30 3 (1994) 143-160
12. Finkel A., and Schnoebelen Ph. Well structured transition systems everywhere!. Theoret. Comput. Sci. 256 1-2 (2001) 63-92
13. Y. Hirshfeld, M. Jerrum, Bisimulation equivalence is decidable for normed process algebra, in: Proc. ICALP'99, Lecture Notes in Computer Science, Vol. 1644, Springer, Berlin, 1999, pp. 412-421.
14. Hirshfeld Y., Jerrum M., and Moller F. A polynomial algorithm for deciding bisimilarity of normed context-free processes. Theoret. Comput. Sci. 158 1-2 (1996) 143-159
15. Hirshfeld Y., Jerrum M., and Moller F. A polynomial algorithm for deciding bisimulation equivalence of normed basic parallel processes. Math. Struct. Comput. Sci. 6 3 (1996) 251-259
16. Jančar P. Undecidability of bisimilarity for Petri nets and some related problems. Theoret. Comput. Sci. 148 2 (1995) 281-301
17. Jančar P., Kučera A., and Mayr R. Deciding bisimulation-like equivalences with finite-state processes. Theoret. Comput. Sci. 258 1-2 (2001) 409-433
18. P. Jančar, A. Kučera, F. Moller, Simulation and bisimulation over one-counter processes, in: Proc. STACS'2000, Lecture Notes in Computer Science, Vol. 1770, Springer, Berlin, 2000, pp. 334-345.
19. Kučera A. On finite representations of infinite-state behaviours. Inform. Proc. Lett. 70 1 (1999) 23-30
20. Kučera A., and Esparza J. A logical viewpoint on process-algebraic quotients. J. Logic Comput. 13 6 (2003) 863-880
21. A. Kučera, P. Jančar, Equivalence-checking on infinite-state systems: techniques and results, Theory Practice of Logic Programming, to appear.
22. A. Kučera, R. Mayr, On the complexity of semantic equivalences for pushdown automata and BPA, in: Proc. MFCS 2002, Lecture Notes in Computer Science, Vol. 2420, Springer, Berlin, 2002, pp. 433-445.
23. Kučera A., and Mayr R. Simulation preorder over simple process algebras. Inform. and Comput. 173 2 (2002) 184-198
24. A. Kučera, R. Mayr, A generic framework for checking semantic equivalences between pushdown automata and finite-state automata, in: Proc. IFIP TCS'2004, Kluwer, Dordrecht, 2004, pp. 395-408.
25. Lugiez D., and Schnoebelen Ph. The regular viewpoint on PA-processes. Theoret. Comput. Sci. 274 1-2 (2002) 89-115
26. R. Mayr, On the complexity of bisimulation problems for pushdown automata, in: Proc. IFIP TCS'2000, Lecture Notes in Computer Science, Vol. 1872, Springer, Berlin, 2000, pp. 474-488.
27. Mayr R. Decidability of model checking with the temporal logic EF. Theoret. Comput. Sci. 256 1-2 (2001) 31-62
28. Milner R. Communication and Concurrency (1989), Prentice-Hall, Englewood Cliffs, NJ
29. Müller-Olm M. Derivation of characteristic formulae. Electronic Notes in Theoretical Computer Science 18 (1998)
30. J. Parrow, P. Sjödin, Multiway synchronization verified with coupled simulation, in: Proc. CONCUR'92, Lecture Notes in Computer Science, Vol. 630, Springer, Berlin, 1992, pp. 518-533.
31. J. Parrow, P. Sjödin, The complete axiomatization of cs-congruence, in: Proc. STACS'94, Lecture Notes in Computer Science, Vol. 775, Springer, Berlin, 1994, pp. 557-568.
32. Schnoebelen Ph. Verifying lossy channel systems has nonprimitive recursive complexity. Inform. Process. Lett. 83 5 (2002) 251-261
33. Sénizergues G. L (A) = L (B)? Decidability results from complete formal systems. Theoret. Comput. Sci. 251 1-2 (2001) 1-166
34. Srba J. Roadmap of infinite results. EATCS Bulletin 78 (2002) 163-175
35. Steffen B., and Ingólfsdóttir A. Characteristic formulae for processes with divergence. Inform. and Comput. 110 1 (1994) 149-163
36. R.J. van Glabbeek, The linear time-branching time spectrum II: the semantics of sequential systems with silent moves, in: Proc. CONCUR'93, Lecture Notes in Computer Science, Vol. 715, Springer, Berlin, 1993, pp. 66-81.
37. van Glabbeek R.J., and Weijland W.P. Branching time and abstraction in bisimulation semantics. J. Assoc. Comput. Mach. 43 3 (1996) 555-600
38. Voorhoeve M., and Mauw S. Impossible futures and determinism. Inform. Process. Lett. 80 1 (2001) 51-58
39. I. Walukiewicz, Model checking CTL properties of pushdown systems, in: Proc. FST&TCS'2000, Lecture Notes in Computer Science, Vol. 1974, Springer, Berlin, 2000, pp. 127-138.
40. I. Walukiewicz, private communication, September 2003.