Deciding finiteness of petri nets up to bisimulation

Petr Jančar, Javier Esparza

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

35 Scopus citations

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.

Original languageEnglish
Title of host publicationAutomata, Languages and Programming - 23rd International Colloquium, ICALP 1996, Proceedings
EditorsFriedhelm Meyer auf der Heide, Burkhard Monien
PublisherSpringer Verlag
Pages478-489
Number of pages12
ISBN (Print)3540614400, 9783540614401
DOIs
StatePublished - 1996
Event23rd International Colloquium on Automata, Languages, and Programming, ICALP 1996 - Paderborn, Germany
Duration: 8 Jul 199612 Jul 1996

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume1099
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference23rd International Colloquium on Automata, Languages, and Programming, ICALP 1996
Country/TerritoryGermany
CityPaderborn
Period8/07/9612/07/96

Fingerprint

Dive into the research topics of 'Deciding finiteness of petri nets up to bisimulation'. Together they form a unique fingerprint.

Cite this