Bisimulation equivalence of a BPP and a finite-state system can be decided in polynomial time

Electronic Notes in Theoretical Computer Science

Volumn 138, Issue 3, 2005, Pages 49-60

  Kot, Martin ^a   Sawa, Zdeněk ^a  

^a VSB TECHNICAL UNIVERSITY OF OSTRAVA   (Czech Republic)

Author keywords

Basic parallel processes; Bisimulation equivalence; Finite state processes

Indexed keywords

ALGORITHMS; COMPUTER SIMULATION; PROBLEM SOLVING; SET THEORY;

BASIC PARALLEL PROCESSES; BISIMULATION EQUIVALENCE; FINITE-STATE PROCESSES; POLYNOMIAL TIME;

POLYNOMIALS;

EID: 29144432152     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.entcs.2005.02.065     Document Type: Conference Paper

References (8)

1. A.V. Aho, J.E. Hopcroft, and J.D. Ullman Design and Analysis of Computer Algorithms 1974 Addison-Wesley Reading
2. S. Christensen, Y. Hirsfeld, and F. Moller Bisimulation is decidable for all basic parallel processes Proc. CONCUR'93 LNCS 715 1993 143 157
3. Y. Hirsfeld, M. Jerrum, and F. Moller A polynomial algorithm for deciding bisimulation equivalence of normed basic parallel processes Mathematical Structures in Computer Science 6 1996 251 259
4. Jančar, P., Strong bisimilarity on basic parallel processes is PSPACE-complete, in: Proc. 18th LiCS (2003), pp. 218-227
5. P. Jančar, and J. Esparza Deciding finiteness of petri nets up to bisimulation Proc. of ICALP'96 LNCS 1099 1996 478 489
6. Jančar, P. and M. Kot, Bisimilarity on normed basic parallel processes can be decided in time O (n 3 ), in: R. Bharadwaj, editor, Proceedings of the Third International Workshop on Automated Verification of Infinite-State Systems - AVIS 2004, 2004
7. R. Paige, and R.E. Tarjan Three partition refinement algorithms SIAM Journal on Computing 16 1987 973 989
8. J. Srba Strong bisimilarity and regularity of basic parallel processes is PSPACE-hard Proc. STACS'02 LNCS 2285 2002 535 546