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

Authors:
Martin Kot;Zdeněk Sawa
Affiliations:
Department of Computer Science, FEI, Technical University of Ostrava, 17. listopadu 15, 70833 Ostrava-Poruba, Czech Republic;Department of Computer Science, FEI, Technical University of Ostrava, 17. listopadu 15, 70833 Ostrava-Poruba, Czech Republic
Venue:
Electronic Notes in Theoretical Computer Science (ENTCS)
Year:
2005

Citing 6
Cited 2

Three partition refinement algorithms

SIAM Journal on Computing
The Design and Analysis of Computer Algorithms

The Design and Analysis of Computer Algorithms
Deciding Finiteness of Petri Nets Up To Bisimulation

ICALP '96 Proceedings of the 23rd International Colloquium on Automata, Languages and Programming
Strong Bisimilarity and Regularity of Basic Parallel Processes Is PSPACE-Hard

STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science
Bisimulation Equivalence is Decidable for Basic Parallel Processes

CONCUR '93 Proceedings of the 4th International Conference on Concurrency Theory
Strong Bisimilarity on Basic Parallel Processes is PSPACE-complete

LICS '03 Proceedings of the 18th Annual IEEE Symposium on Logic in Computer Science

EXPSPACE lower bounds for the simulation preorder between a communication-free Petri net and a finite-state system

Information Processing Letters
On Minimality and Equivalence of Petri Nets

Fundamenta Informaticae - Concurrency, Specification and Programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we consider the problem of deciding bisimulation equivalence of a BPP and a finite-state system. We show that the problem can be solved in polynomial time and we present an algorithm deciding the problem in time O(n^4). The algorithm also constructs for each state of the finite-state system a 'symbolic' semilinear representation of the set of all states of the BPP system which are bisimilar with this state.