The following pages link to Understanding Petri Nets (Q4911790):
Displaying 50 items.
- Petri nets properties related to the unboundness and analyzed using coverability multigraph (Q275588) (← links)
- Model checking Petri nets with names using data-centric dynamic systems (Q315291) (← links)
- Reversible session-based pi-calculus (Q492908) (← links)
- Dynamic analysis of Petri net-based discrete systems (Q885347) (← links)
- Untanglings: a novel approach to analyzing concurrent systems (Q903488) (← links)
- Sufficient and necessary condition to decide compatibility for a class of interorganizational workflow nets (Q1665580) (← links)
- Signal set tissue systems and overlapping localities (Q1682863) (← links)
- Cellular adaptive Petri net based on learning automata and its application to the vertex coloring problem (Q1686849) (← links)
- Efficient modelling of yeast cell cycles based on multisite phosphorylation using coloured hybrid Petri nets with marking-dependent arc weights (Q1690502) (← links)
- Model-based fault identification of discrete event systems using partially observed Petri nets (Q1716461) (← links)
- Associative composition of components with double-sided interfaces (Q1733102) (← links)
- Composition colored Petri nets for the refinement of reaction-based models (Q1744368) (← links)
- Ensuring liveness properties of distributed systems: open problems (Q2011206) (← links)
- A study on team bisimulation and H-team bisimulation for BPP nets (Q2055961) (← links)
- Computing parameterized invariants of parameterized Petri nets (Q2117165) (← links)
- Firing partial orders in a Petri net (Q2117188) (← links)
- Concurrency and objects matter! Disentangling the fabric of real operational processes to create digital twins (Q2119954) (← links)
- Discovering process models with long-term dependencies while providing guarantees and handling infrequent behavior (Q2165244) (← links)
- Data and process resonance. Identifier soundness for models of information systems (Q2165251) (← links)
- Solving high-level Petri games (Q2182671) (← links)
- Team equivalences for finite-state machines with silent moves (Q2216117) (← links)
- Automatic construction of systems of distributed components from nested Petri nets models (Q2216722) (← links)
- Consensus formation in networks with neighbor-dependent synergy and observer effect (Q2219574) (← links)
- Team bisimilarity, and its associated modal logic, for BPP nets (Q2231652) (← links)
- Complexity of the deadlock problem for Petri nets modeling resource allocation systems (Q2279727) (← links)
- A survey of siphons in Petri nets (Q2279728) (← links)
- An extension of the taxonomy of persistent and nonviolent steps (Q2293146) (← links)
- Generating all minimal Petri net unsolvable binary words (Q2295623) (← links)
- Presynthesis of bounded choice-free or fork-attribution nets (Q2304527) (← links)
- Structural liveness of Petri nets is \textsc{ExpSpace}-hard and decidable (Q2317836) (← links)
- Verification of finite-state machines: a distributed approach (Q2413026) (← links)
- Reversible computation in nets with bonds (Q2667186) (← links)
- Transformation of variants of Petri nets into context-dependent fusion grammars (Q2672655) (← links)
- A kinetic theory model for the energy-demand management in a microgrid-macrogrid network (Q2685792) (← links)
- Petri nets for system engineering. A guide to modeling, verification, and applications (Q2740516) (← links)
- Deciding the liveness for a subclass of weighted Petri nets based on structurally circular wait (Q2798480) (← links)
- Characterising Petri Net Solvable Binary Words (Q2822650) (← links)
- Deciding Structural Liveness of Petri Nets (Q2971127) (← links)
- Structure Preserving Bisimilarity, Supporting an Operational Petri Net Semantics of CCSP (Q3449628) (← links)
- (Q3575995) (← links)
- Coloured Petri Nets (Q3617245) (← links)
- (Q3732970) (← links)
- (Q4553276) (← links)
- Discrete, Continuous, and Hybrid Petri Nets (Q4827468) (← links)
- Investigating Reversibility of Steps in Petri Nets (Q5025059) (← links)
- (Q5028437) (← links)
- Computing Parameterized Invariants of Parameterized Petri Nets (Q5044400) (← links)
- PSPACE-Completeness of the Soundness Problem of Safe Asymmetric-Choice Workflow Nets (Q5100757) (← links)
- Compositional Specification in Rewriting Logic (Q5108529) (← links)
- Free-choice Nets with Home Clusters are Lucent (Q5158668) (← links)
