PN Standardisation: A Survey
From MaRDI portal
Recommendations
Cites work
- A symbolic reachability graph for coloured Petri nets
- scientific article; zbMATH DE number 3825182 (Why is no real title available?)
- scientific article; zbMATH DE number 3722109 (Why is no real title available?)
- scientific article; zbMATH DE number 50851 (Why is no real title available?)
- scientific article; zbMATH DE number 1049168 (Why is no real title available?)
- scientific article; zbMATH DE number 2115035 (Why is no real title available?)
- Petri nets and algebraic specifications
Cited in
(7)- Canonical representations for direct generation of strategies in high-level Petri games
- Solving high-level Petri games
- The ePNK: an extensible Petri net tool for PNML
- A Simple Positive Flows Computation Algorithm for a Large Subclass of Colored Nets
- Towards a Standard for Modular Petri Nets: A Formalisation
- Extending PNML scope: a framework to combine Petri nets types
- The Petri net markup language
This page was built for publication: PN Standardisation: A Survey
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3613078)