Equivalence checking of non-flat systems is EXPTIME-hard

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

Volumn 2761, Issue , 2003, Pages 237-250

  Sawa, Zdeněk ^a  

^a VSB TECHNICAL UNIVERSITY OF OSTRAVA   (Czech Republic)

Author keywords

Complexity; Equivalence checking; Finite state systems

Indexed keywords

PETRI NETS;

BISIMULATION EQUIVALENCES; COMPLEXITY; EQUIVALENCE CHECKING; EXPTIME; FINITE STATE SYSTEMS; NON FLATS; PARALLEL COMPOSITION; TRACE EQUIVALENCE;

EQUIVALENCE CLASSES;

EID: 35248821677     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-45187-7_16     Document Type: Article

References (10)

1. A.K. Chandra, D.C. Kozen, and L.J. Stockmeyer. Alternation. Journal of the Association for Computing Machinery, 28(1):114-133, January 1981.
2. N. Immerman. Descriptive Complexity, pages 53-54. Springer-Verlag, 1998.
3. P. Jančar. Nonprimitive recursive complexity and undecidability for petri net equivalences. Theoretical Computer Science, 256:23-30, 2001.
4. L. Jategaonkar and A. R. Meyer. Deciding true concurrency equivalences on safe, finite nets. Theoretical Computer Science, 154(1):107-143, January 1996.
5. F. Laroussinie and P. Schnoebelen. The state explosion problem from trace to bisimulation equivalence. In Proc. FOSSACS'2000 (Berlin, Germany, Mar.-Apr. 2000), volume 1784, pages 192-207. Springer, 2000.
6. A. Rabinovich. Complexity of equivalence problems for concurrent systems of finite agents. Information and Computation, 139(2):111-129, 15 December 1997.
7. Z. Sawa and P. Jančar. P-hardness of equivalence testing on finite-state processes. In Proc. SOFSEM 2001 (Piestany, Slovak Rep., November 2001), volume 2234 of Lecture Notes in Computer Science, page 326. Springer, 2001.
8. S. K. Shukla, H. B. Hunt, D. J. Rosenkrantz, and R. E. Stearns. On the complexity of relational problems for finite state processes. In Proc. ICALP'96 (Paderborn, Germany), volume 1099 of Lecture Notes in Computer Science, pages 466-477. Springer-Verlag, 1996.
9. A. Valmari and A. Kervinen. Alphabet-based synchronisation is exponentially cheaper. In Proc. CONCUR 2002, volume 2421 of Lecture Notes in Computer Science, page 161. Springer, 2002.
10. R.J. van Glabbeek. The Linear Time - Branching Time Spectrum. In J.C.M. Baeten and J.W. Klop, editors, Proceedings of CONCUR '90, Theories of Concurrency: Unification and Extension, volume 458 of Lecture Notes in Computer Science, pages 278-297. Springer-Verlag, Berlin, 1990.