Properties of Plain, Pure, and Safe Petri Nets

DOI10.1007/978-3-662-55862-1_1MaRDI QIDQ4994075zbMATH OpenOpenAlexFDO

Authors Kamila Barylska, Eike Best, Uli Schlachter, Valentin Spreckels

Publication date 14 June 2021

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-662-55862-1_1

zbMATH Keywords

labelled transition systemsmarked graphsPetri nets

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• scientific article; zbMATH DE number 5033884
• scientific article; zbMATH DE number 4033101
• On the Construction of Pullbacks for Safe Petri Nets
• Making Petri nets safe and free of internal transitions
• scientific article; zbMATH DE number 5286860
• A Canonical Contraction for Safe Petri Nets
• Automated Technology for Verification and Analysis
• Structural properties of petri nets
• scientific article; zbMATH DE number 3976355
• On possibilistic timed safe Petri nets

Cited in

(5)

• A Canonical Contraction for Safe Petri Nets
• scientific article; zbMATH DE number 5286860 (Why is no real title available?)
• On the Construction of Pullbacks for Safe Petri Nets
• Target-oriented Petri net synthesis
• scientific article; zbMATH DE number 5033884 (Why is no real title available?)

This page was built for publication: Properties of Plain, Pure, and Safe Petri Nets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4994075)