Undecidability of bisimilarity for Petri nets and some related problems

The main result shows the undecidability of (strong) bisimilarity for labelled (place/transition) Petri nets. The technique of the proof applies to the language (or trace) equivalence and the reachability set equality as well, which yields stronger versions with simpler proofs of already known resul...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Theoretical computer science 1995-09, Vol.148 (2), p.281-301
1. Verfasser:	JANCAR, P
Format:	Artikel
Sprache:	eng
Schlagworte:	Algebra Algebraic geometry Algorithmics. Computability. Computer arithmetics Applied sciences Computer science control theory systems Exact sciences and technology Language theory and syntactical analysis Logic and foundations Mathematical logic, foundations, set theory Mathematics Recursion theory Sciences and techniques of general use Theoretical computing
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!