Unifying Petri Net Semantics with Token Flows
From MaRDI portal
Recommendations
- Faster Unfolding of General Petri Nets Based on Token Flows
- Token-Free Petri Nets
- scientific article; zbMATH DE number 1497817
- Unifying the semantics of modular extensions of Petri nets
- scientific article; zbMATH DE number 1101600
- Unifying Petri nets. Advances in Petri nets
- scientific article; zbMATH DE number 1302631
- scientific article; zbMATH DE number 3974312
- Token trail semantics -- modeling behavior of Petri nets with labeled Petri nets
Cites work
- Applications and Theory of Petri Nets 2005
- Axiomatizing the algebra of net computations and processes
- Developments in Language Theory
- Executability of scenarios in Petri nets
- Faster Unfolding of General Petri Nets Based on Token Flows
- Formal methods: Foundations and applications. 12th Brazilian symposium on formal methods, SBMF 2009, Gramado, Brazil, August 19--21, 2009. Revised selected papers
- scientific article; zbMATH DE number 3829262 (Why is no real title available?)
- scientific article; zbMATH DE number 4087033 (Why is no real title available?)
- scientific article; zbMATH DE number 4089320 (Why is no real title available?)
- scientific article; zbMATH DE number 3735177 (Why is no real title available?)
- Modeling concurrency with partial orders
- Petri nets are monoids
- Sequential and concurrent behaviour in Petri net theory
- Synthesis of Petri nets from finite partial languages
- The equational theory of pomsets
- The non-sequential behaviour of Petri nets
- Towards Synthesis of Petri Nets from Scenarios
Cited in
(4)
This page was built for publication: Unifying Petri Net Semantics with Token Flows
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3636837)