Methods for Efficient Unfolding of Colored Petri Nets

Fundamenta Informaticae, Volume 189, Issues 3-4: Reachability Problems 2020 and 2021 (October 14, 2023) fi:9351 Colored Petri nets offer a compact and user friendly representation of the traditional P/T nets and colored nets with finite color ranges can be unfolded into the underlying P/T nets, howe...

Ausführliche Beschreibung

Bibliographische Detailangaben

Hauptverfasser:	Bilgram, Alexander, Jensen, Peter G, Pedersen, Thomas, Srba, Jiri, Taankvist, Peter H
Format:	Artikel
Sprache:	eng
Schlagworte:	Computer Science - Logic in Computer Science
Online-Zugang:	Volltext bestellen
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!