The following pages link to Petri nets with individual tokens (Q1083212):
Displaying 21 items.
- Existence of home states in Petri nets is decidable (Q264201) (← links)
- Introduction to design choices in the semantics of Statecharts (Q750133) (← links)
- Petri nets and algebraic specifications (Q804305) (← links)
- Question-guided stubborn set methods for state properties (Q862861) (← links)
- Step semantics for ``true'' concurrency with recursion (Q916408) (← links)
- Branching processes of Petri nets (Q1175711) (← links)
- Comparing locality and causality based equivalences (Q1342503) (← links)
- A truly concurrent semantics for a process algebra using resource pomsets (Q1603698) (← links)
- Distributed monitoring of concurrent and asynchronous systems (Q1773098) (← links)
- A compositional dataflow semantics for Petri nets (Q1902302) (← links)
- Trellis processes: a compact representation for runs of concurrent systems (Q2465670) (← links)
- Reversible computation in nets with bonds (Q2667186) (← links)
- A New Strategy for Distributed Compensations with Interruption in Long-Running Transactions (Q2890323) (← links)
- A Graph-Theoretical Characterisation of State Separation (Q2971132) (← links)
- Twenty Years on: Reflections on the CEDISYS Project. Combining True Concurrency with Process Algebra (Q3507401) (← links)
- Modelling of Complex Software Systems: A Reasoned Overview (Q3613056) (← links)
- Deciding Substitutability of Services with Operating Guidelines (Q3623825) (← links)
- A Conceptual and Formal Framework for the Integration of Data Type and Process Modeling Techniques (Q4921549) (← links)
- Dataflow semantics for Petri nets (Q5096839) (← links)
- A fully abstract semantics for termination in Petri nets (Q5096896) (← links)
- Asynchronous communication of Petri Nets and the refinement of transitions (Q5204351) (← links)
