PN Standardisation: A Survey

DOI10.1007/11888116_23zbMath1225.68125OpenAlexW1498228645MaRDI QIDQ3613078

Nicolas Treves, Lom-Messan Hillah, Fabrice Kordon, Laure Petrucci

Publication date: 11 March 2009

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

Full work available at URL: https://doi.org/10.1007/11888116_23

Mathematics Subject Classification ID

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

Related Items (3)

Solving high-level Petri games ⋮ A Simple Positive Flows Computation Algorithm for a Large Subclass of Colored Nets ⋮ Canonical representations for direct generation of strategies in high-level Petri games

Uses Software

• PNML
• Relax NG

Cites Work

• Petri nets and algebraic specifications
• A symbolic reachability graph for coloured Petri nets
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: PN Standardisation: A Survey