The following pages link to (Q4251922):
Displaying 19 items.
- Efficient unfolding of contextual Petri nets (Q443729) (← links)
- Partial order semantics and read arcs (Q1608891) (← links)
- Interval semantics for Petri nets with inhibitor arcs (Q1749475) (← links)
- Contextual Petri nets, asymmetric event structures, and processes (Q1854468) (← links)
- Domain and event structure semantics for Petri nets with read and inhibitor arcs (Q1882900) (← links)
- Symbolic unfolding of parametric stopwatch Petri nets (Q2248088) (← links)
- Branching cells for asymmetric event structures (Q2253176) (← links)
- Timed Petri nets and timed automata: On the discriminating power of Zeno sequences (Q2475807) (← links)
- On Interval Process Semantics of Petri Nets with Inhibitor Arcs (Q2941144) (← links)
- Non-atomic Transition Firing in Contextual Nets (Q2941146) (← links)
- A Distributed Computing Model for Dataflow, Controlflow, and Workflow in Fractionated Cyber-Physical Systems (Q2944903) (← links)
- An Algorithm for Direct Construction of Complete Merged Processes (Q3011883) (← links)
- Efficient Contextual Unfolding (Q3090840) (← links)
- Unfolding Graph Transformation Systems: Theory and Applications to Verification (Q3507354) (← links)
- Directed Unfolding of Petri Nets (Q3599218) (← links)
- McMillan’s Complete Prefix for Contextual Nets (Q3599219) (← links)
- (Q4553276) (← links)
- Concurrency for Graph Grammars in a Petri net shell (Q4923530) (← links)
- Construction and SAT-Based Verification of Contextual Unfoldings (Q5200078) (← links)