The following pages link to Complexity results for 1-safe nets (Q672459):
Displaying 26 items.
- Linear time analysis of properties of conflict-free and general Petri nets (Q620942) (← links)
- Partially commutative inverse monoids. (Q958191) (← links)
- Distributed semantics for the \(\pi \)-calculus based on Petri nets with inhibitor ARCS (Q1007235) (← links)
- Petri nets, traces, and local model checking (Q1391100) (← links)
- Analysis issues in Petri nets with inhibitor arcs (Q1606123) (← links)
- On the expressiveness of Linda coordination primitives. (Q1854324) (← links)
- The complexity of verifying population protocols (Q2025857) (← links)
- Analysis of safeness in a Petri net-based specification of the control part of cyber-physical systems (Q2115918) (← links)
- Timed Petri nets with reset for pipelined synchronous circuit design (Q2117152) (← links)
- Efficient algorithms for three reachability problems in safe Petri nets (Q2117182) (← links)
- Waiting nets (Q2165233) (← links)
- Static analysis and stochastic search for reachability problem (Q2229143) (← links)
- Complexity of the deadlock problem for Petri nets modeling resource allocation systems (Q2279727) (← links)
- Nested-unit Petri nets (Q2423743) (← links)
- A process algebraic view of shared dataspace coordination (Q2474048) (← links)
- Deciding the liveness for a subclass of weighted Petri nets based on structurally circular wait (Q2798480) (← links)
- Anti-alignments in Conformance Checking – The Dark Side of Process Models (Q2822655) (← links)
- Comparative analysis of the expressiveness of shared dataspace coordination (Q2841273) (← links)
- On the Complexity of Reconfiguration in Systems with Legacy Components (Q2946354) (← links)
- Analyzing Reachability for Some Petri Nets With Fast Growing Markings (Q4982096) (← links)
- Verification of Immediate Observation Population Protocols (Q5009448) (← links)
- (Q5111631) (← links)
- On Petri Nets with Hierarchical Special Arcs (Q5111656) (← links)
- Concurrency in Boolean networks (Q6151158) (← links)
- A P systems variant for reasoning about sequential controllability of Boolean networks (Q6168086) (← links)
- Waiting Nets: State Classes and Taxonomy (Q6189319) (← links)
