The following pages link to (Q4247286):
Displaying 28 items.
- Petri nets properties related to the unboundness and analyzed using coverability multigraph (Q275588) (← links)
- Localities in systems with a/sync communication (Q418785) (← links)
- Step coverability algorithms for communicating systems (Q433351) (← links)
- Modeling concurrency with interval traces (Q515576) (← links)
- Decidability and complexity of Petri nets with unordered data (Q554219) (← links)
- Structure and behavior preservation by Petri-net-based refinements in system design (Q703482) (← links)
- Question-guided stubborn set methods for state properties (Q862861) (← links)
- Executability of scenarios in Petri nets (Q1006647) (← links)
- Interval semantics for Petri nets with inhibitor arcs (Q1749475) (← links)
- Small vertex cover makes Petri net coverability and boundedness easier (Q1949744) (← links)
- A study on team bisimulation and H-team bisimulation for BPP nets (Q2055961) (← links)
- Branching place bisimilarity: a decidable behavioral equivalence for finite Petri nets with silent moves (Q2117014) (← links)
- Firing partial orders in a Petri net (Q2117188) (← links)
- Combining free choice and time in Petri nets (Q2291812) (← links)
- Robustness of deadlock control for a class of Petri nets with unreliable resources (Q2446458) (← links)
- Petri net reactive modules (Q2503287) (← links)
- Petri nets with name creation for transient secure association (Q2510386) (← links)
- Transformation of variants of Petri nets into context-dependent fusion grammars (Q2672655) (← links)
- On the Expressiveness of Mobile Synchronizing Petri Nets (Q2864393) (← links)
- Language Representability of Finite P/T Nets (Q3460873) (← links)
- On the Analysis of Petri Nets and their Synthesis from Process Languages (Q4462676) (← links)
- (Q4807466) (← links)
- Modeling Petri Nets by Local Action Systems1 1Partially supported by the EC TMR Network GETGRATS (General Theory of Graph Transformation Systems) and Esprit Working Group APPLIGRAPH through Universitaire Instelling Antwerpen. (Q4921556) (← links)
- Unifying Petri Nets with Restricted Occurrence Rule Using Partial Algebra (Q4923515) (← links)
- Stop-transitions of Petri Nets* (Q4988957) (← links)
- Causal Semantics for BPP Nets with Silent Moves (Q5164874) (← links)
- Interval traces with mutex relation (Q6535190) (← links)
- Token trail semantics -- modeling behavior of Petri nets with labeled Petri nets (Q6535197) (← links)
