Regular marked Petri nets

DOI10.1007/3-540-57899-4_58MaRDI QIDQ6143982zbMATH OpenFDO

Authors Jörg Desel

Publication date 5 January 2024

Published in Graph-Theoretic Concepts in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-57899-4_58

Mathematics Subject Classification ID

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

Recommendations

• On the regularity of Petri net languages
• An \(O(|S|\times|T|)\)-algorithm to verify if a net is regular
• Characterisation of the state spaces of marked graph Petri nets
• scientific article; zbMATH DE number 4014038
• scientific article; zbMATH DE number 4033101

Cites work

• scientific article; zbMATH DE number 4024806 (Why is no real title available?)
• scientific article; zbMATH DE number 512938 (Why is no real title available?)
• Partial order behaviour and structure of Petri nets
• Petri nets with individual tokens
• Properties and performance bounds for closed free choice synchronized monoclass queueing networks
• Reachability in cyclic extended free-choice systems
• Shortest paths in reachability graphs
• Traps characterize home states in free choice systems

Cited in

(1)

• Deterministic weak-and-marked Petri net languages are regular

This page was built for publication: Regular marked Petri nets

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