I7 Logo
Chair for Foundations of Software Reliability and Theoretical Computer Science
Informatik Logo TUM Logo
Publications - Deciding finiteness of Petri nets up to bisimulation

Reference:

P. Jancar and J. Esparza. Deciding finiteness of Petri nets up to bisimulation. SFB-Bericht Nr. 342/23/95A, TU München, 1995.

Abstract:

We study the following problems for strong and weak bisimulation equivalence: Given a labelled Petri net and a finite transition system, are they equivalent? Given a labelled Petri net, is it equivalent to some (unspecified) finite transition system? We show that both problems are decidable for strong bisimulation and undecidable for weak bisimulation.

Suggested BibTeX entry:

@techreport{JE95,
    author = {P. Jancar and J. Esparza},
    institution = {TU M{\"u}nchen},
    number = {Nr. 342/23/95A},
    title = {Deciding finiteness of {P}etri nets up to bisimulation},
    type = {SFB-Bericht},
    year = {1995}
}

GZipped PostScript (356 kB)
PDF (826 kB)
Conference version, Journal version