论文信息 - Deciding Finiteness of Petri Nets Up To Bisimulation

Deciding Finiteness of Petri Nets Up To Bisimulation

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.

Javier Esparza | Petr Jancar

[1] Petr Jancar. All action-based behavioural equivalences are undecidable for labelled Petri nets , 1995, Bull. EATCS.

[2] Rüdiger Valk,et al. Petri Nets and Regular Languages , 1981, J. Comput. Syst. Sci..

[3] Faron Moller,et al. Bisimulation Equivalence is Decidable for Basic Parallel Processes , 1993, CONCUR.

[4] Søren Christensen,et al. Bisimulation Equivalence is Decidable for all Context-Free Processes , 2022 .

[5] Jeffrey D. Ullman,et al. Introduction to Automata Theory, Languages and Computation , 1979 .

[6] Faron Moller,et al. Checking Regular Properties of Petri Nets , 1995, CONCUR.

[7] Mogens Nielsen,et al. Decidability Issues for Petri Nets - a survey , 1994, Bull. EATCS.

[8] Yoram Hishfeld. Petri Nets and the Equivalence Problem , 1993 .

[9] Petr Jancar,et al. Decidability of a Temporal Logic Problem for Petri Nets , 1990, Theor. Comput. Sci..

[10] Petr Jancar. Undecidability of Bisimilarity for Petri Nets and Some Related Problems , 1995, Theor. Comput. Sci..

[11] Hans Mulder,et al. Regularity of BPA-Systems is Decidable , 1994, CONCUR.