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

Yoram Hirshfeld; Mark Jerrum; Faron Moller

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

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

Yoram Hirshfeld, Mark Jerrum, Faron Moller^*

^*Corresponding author for this work

Research output: Contribution to journal › Article › peer-review

Abstract

The previous best upper bound on the complexity of deciding bisimilarity between normed context-free processes is due to Huynh and Tian (1994), who put the problem in ∑^P₂ = NP^NP: their algorithm guesses a proof of equivalence and validates this proof in polynomial time using oracles freely answering questions which are in NP. In this paper we improve on this result by describing a polynomial-time algorithm which solves this problem. As a corollary, we have a polynomial algorithm for the equivalence problem for simple grammars.

Original language	English
Pages (from-to)	143-159
Number of pages	17
Journal	Theoretical Computer Science
Volume	158
Issue number	1-2
DOIs	https://doi.org/10.1016/0304-3975(95)00064-X
State	Published - 20 May 1996
Externally published	Yes

Access to Document

10.1016/0304-3975(95)00064-X

Cite this

@article{6a73cadc9a93463fbdffc8c01ef1ae07,

title = "A polynomial algorithm for deciding bisimilarity of normed context-free processes",

abstract = "The previous best upper bound on the complexity of deciding bisimilarity between normed context-free processes is due to Huynh and Tian (1994), who put the problem in ∑P2 = NPNP: their algorithm guesses a proof of equivalence and validates this proof in polynomial time using oracles freely answering questions which are in NP. In this paper we improve on this result by describing a polynomial-time algorithm which solves this problem. As a corollary, we have a polynomial algorithm for the equivalence problem for simple grammars.",

author = "Yoram Hirshfeld and Mark Jerrum and Faron Moller",

note = "Funding Information: * Dedicated to Robin Milner on the occasion of his 60th birthday. * Corresponding author. {\textquoteright} On Sabbatical leave from The School of Mathematics and Computer Science, Tel Aviv University. 2A Nuffield Foundation Science Research Fellow, and supported in part by grant GR/F 90363 of the UK Science and Engineering Research Council, and by Esprit Working Group No. 7097, “RAND”. 3 Supported by Esprit Basic Research Action No. 7166, “CONCUR2,” and currently at the Swedish Institute of Computer Science, Box 1263, 16428 Kista, Sweden. 4 Recall that a grammar is in Greibach normal form if the right-hand side of every production consists of a single terminal followed by a (possibly empty) sequence of variables. It is in k-Greibach normal form if moreover this sequence of variables is bounded in length by k.",

year = "1996",

month = may,

day = "20",

doi = "10.1016/0304-3975(95)00064-X",

language = "אנגלית",

volume = "158",

pages = "143--159",

journal = "Theoretical Computer Science",

issn = "0304-3975",

publisher = "Elsevier",

number = "1-2",

}

TY - JOUR

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

AU - Hirshfeld, Yoram

AU - Jerrum, Mark

AU - Moller, Faron

N1 - Funding Information: * Dedicated to Robin Milner on the occasion of his 60th birthday. * Corresponding author. ’ On Sabbatical leave from The School of Mathematics and Computer Science, Tel Aviv University. 2A Nuffield Foundation Science Research Fellow, and supported in part by grant GR/F 90363 of the UK Science and Engineering Research Council, and by Esprit Working Group No. 7097, “RAND”. 3 Supported by Esprit Basic Research Action No. 7166, “CONCUR2,” and currently at the Swedish Institute of Computer Science, Box 1263, 16428 Kista, Sweden. 4 Recall that a grammar is in Greibach normal form if the right-hand side of every production consists of a single terminal followed by a (possibly empty) sequence of variables. It is in k-Greibach normal form if moreover this sequence of variables is bounded in length by k.

PY - 1996/5/20

Y1 - 1996/5/20

N2 - The previous best upper bound on the complexity of deciding bisimilarity between normed context-free processes is due to Huynh and Tian (1994), who put the problem in ∑P2 = NPNP: their algorithm guesses a proof of equivalence and validates this proof in polynomial time using oracles freely answering questions which are in NP. In this paper we improve on this result by describing a polynomial-time algorithm which solves this problem. As a corollary, we have a polynomial algorithm for the equivalence problem for simple grammars.

AB - The previous best upper bound on the complexity of deciding bisimilarity between normed context-free processes is due to Huynh and Tian (1994), who put the problem in ∑P2 = NPNP: their algorithm guesses a proof of equivalence and validates this proof in polynomial time using oracles freely answering questions which are in NP. In this paper we improve on this result by describing a polynomial-time algorithm which solves this problem. As a corollary, we have a polynomial algorithm for the equivalence problem for simple grammars.

UR - http://www.scopus.com/inward/record.url?scp=0030145876&partnerID=8YFLogxK

U2 - 10.1016/0304-3975(95)00064-X

DO - 10.1016/0304-3975(95)00064-X

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:0030145876

SN - 0304-3975

VL - 158

SP - 143

EP - 159

JO - Theoretical Computer Science

JF - Theoretical Computer Science

IS - 1-2

ER -

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

Abstract

Access to Document

Other files and links

Fingerprint

Cite this