TY - GEN
T1 - Deciding finiteness of petri nets up to bisimulation
AU - Jančar, Petr
AU - Esparza, Javier
N1 - Publisher Copyright:
© Springer-Verlag Berlin Heidelberg 1996.
PY - 1996
Y1 - 1996
N2 - 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.
AB - 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.
UR - https://www.scopus.com/pages/publications/84886367555
U2 - 10.1007/3-540-61440-0_152
DO - 10.1007/3-540-61440-0_152
M3 - Conference contribution
AN - SCOPUS:84886367555
SN - 3540614400
SN - 9783540614401
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 478
EP - 489
BT - Automata, Languages and Programming - 23rd International Colloquium, ICALP 1996, Proceedings
A2 - Meyer auf der Heide, Friedhelm
A2 - Monien, Burkhard
PB - Springer Verlag
T2 - 23rd International Colloquium on Automata, Languages, and Programming, ICALP 1996
Y2 - 8 July 1996 through 12 July 1996
ER -