A polynomial algorithm for deciding bisimilarity of normed context-free processes

Hirshfeld, Yoram; Jerrum, Mark; Moller, Faron

doi:10.1016/0304-3975(95)00064-x

Cited by 118 publications

(105 citation statements)

References 9 publications

Supporting

Mentioning

103

Contrasting

Unclassified

Order By: Relevance

“…Although using different techniques, the results for BPP resemble very much those for BPA (Basic Process Algebra; cf. [3], [8]). …”

Section: E I E+ E I Eiiementioning

confidence: 99%

High undecidability of weak bisimilarity for Petri nets

Jancar

1995

TAPSOFT '95: Theory and Practice of Software Development

View full text Add to dashboard Cite

It is shown that the problem whether two labelled place/transition Petri nets (with initial markings) are weakly bisimilar is highly undecidable -it resides at least at level w of the hyperarithmetical hierarchy; on the other hand it belongs to E~ (the first level of the analytical hierarchy). It contrasts with II~ of the same problem for trace (language) equivalence. Relations to similar problems for the process algebra BPP (Basic Parallel Processes) are also discussed.

show abstract

“…Although using different techniques, the results for BPP resemble very much those for BPA (Basic Process Algebra; cf. [3], [8]). …”

Section: E I E+ E I Eiiementioning

confidence: 99%

High undecidability of weak bisimilarity for Petri nets

Jancar

1995

TAPSOFT '95: Theory and Practice of Software Development

View full text Add to dashboard Cite

show abstract

“…Again, in order to prove the containment of the problem in some lower complexity class (PSPACE, NP or even P), it is enough to demonstrate a decision algorithm (running with the corresponding complexity) for normed and unlabelled BPA δ systems. This is especially interesting because the bisimilarity checking problem for normed BPA (without deadlocks) is known to be decidable in polynomial time [HJM96].…”

Section: Bpa and Bppmentioning

confidence: 99%

On the Power of Labels in Transition Systems

Srba¹

2001

BRICS

View full text Add to dashboard Cite

Abstract. In this paper we discuss the role of labels in transition systems with regard to bisimilarity and model checking problems. We suggest a general reduction from labelled transition systems to unlabelled ones, preserving bisimilarity and satisfiability of µ-calculus formulas. We apply the reduction to the class of transition systems generated by Petri nets and pushdown automata, and obtain several decidability/complexity corollaries for unlabelled systems. Probably the most interesting result is undecidability of strong bisimilarity for unlabelled Petri nets.

show abstract

“…Then we show that the bisimulation base can be computed in polynomial time. To do that, we take a sufficiently large relation G which surely subsumes the base and 'refine' it (this refinement technique has been used in [15,16]). The size of G is still O(n m 2 ), and each step of the refinement procedure possibly deletes some of the elements of G. If nothing is deleted, we have found the base (hence we need at most O(n m 2 ) steps).…”

Section: Intuitionmentioning

confidence: 99%

“…Baeten, Bergstra, and Klop [1] proved that strong bisimilarity [29] is decidable for normed BPA processes. Simpler proofs have been given later in [18,13], and there is even a polynomial-time algorithm [15]. The decidability result has later been extended to the class of all (not necessarily normed) BPA processes in [9], but the best known algorithm is doubly exponential [4].…”

Section: Introductionmentioning

confidence: 99%