Pages that link to "Item:Q4164838"
From MaRDI portal
The following pages link to Properties of Conflict-Free and Persistent Petri Nets (Q4164838):
Displaying 45 items.
- Characterisation of the state spaces of marked graph Petri nets (Q515678) (← links)
- Linear time analysis of properties of conflict-free and general Petri nets (Q620942) (← links)
- Complexity results for 1-safe nets (Q672459) (← links)
- A polynomial time algorithm to decide pairwise concurrency of transitions for 1-bounded conflict-free Petri nets (Q809611) (← links)
- A decomposition theorem for finite persistent transition systems (Q1015394) (← links)
- Equality of languages coincides with isomorphism of reachable state graphs for bounded and persistent Petri nets (Q1041759) (← links)
- Normal Petri nets (Q1057065) (← links)
- Some complexity bounds for problems concerning finite and 2-dimensional vector addition systems with states (Q1096388) (← links)
- An \(O(n^{1.5})\) algorithm to decide boundedness for conflict-free vector replacement systems (Q1097037) (← links)
- Performance evaluation of concurrent systems using conflict-free and persistent Petri nets (Q1108799) (← links)
- Completeness results for conflict-free vector replacement systems (Q1113674) (← links)
- Problems concerning fairness and temporal logic for conflict-free Petri nets (Q1121023) (← links)
- The decidability of persistence for vector addition systems (Q1144929) (← links)
- Persistence of vector replacement systems is decidable (Q1149775) (← links)
- On weak persistency of Petri nets (Q1158764) (← links)
- The complexity of problems involving structurally bounded and conservative Petri nets (Q1183417) (← links)
- A unified approach for deciding the existence of certain petri net paths (Q1184737) (← links)
- On structural conditions for weak persistency and semilinearity of Petri nets (Q1186602) (← links)
- A solution to the covering problem for 1-bounded conflict-free Petri nets using linear programming (Q1197993) (← links)
- Normal and sinkless Petri nets (Q1208921) (← links)
- Complexity of some problems in Petri nets (Q1238999) (← links)
- Analysis of a class of communicating finite state machines (Q1323365) (← links)
- Deciding a class of path formulas for conflict-free Petri nets (Q1364130) (← links)
- A valuation-based analysis of conflict-free Petri nets (Q1605406) (← links)
- Sufficient conditions for the marked graph realisability of labelled transition systems (Q1623288) (← links)
- Bounded choice-free Petri net synthesis: algorithmic issues (Q1789066) (← links)
- Asynchrony and persistence in reaction systems (Q2044949) (← links)
- Abstract processes and conflicts in place/transition systems (Q2051771) (← links)
- Synthesis and reengineering of persistent systems (Q2257983) (← links)
- An extension of the taxonomy of persistent and nonviolent steps (Q2293146) (← links)
- Presynthesis of bounded choice-free or fork-attribution nets (Q2304527) (← links)
- Observable liveness of Petri nets (Q2340254) (← links)
- Execution termination and computation determinacy of data-flow program nets (Q2638758) (← links)
- Characterising Petri Net Solvable Binary Words (Q2822650) (← links)
- Petri Nets and Semilinear Sets (Extended Abstract) (Q3179388) (← links)
- PATH DECOMPOSITION AND SEMILINEARITY OF PETRI NETS (Q3395130) (← links)
- A Note on Persistent Petri Nets (Q3507378) (← links)
- Decomposition Theorems for Bounded Persistent Petri Nets (Q3510855) (← links)
- Deterministic asynchronous interpretation of parallel microprograms (Q3741033) (← links)
- REGULAR STATE MACHINES (Q4526933) (← links)
- (Q4553276) (← links)
- Target-oriented Petri Net Synthesis (Q4988954) (← links)
- Synthesis of Persistent Systems (Q5166759) (← links)
- Conditions for Petri Net Solvable Binary Words (Q5268428) (← links)
- Step Persistence in the Design of GALS Systems (Q5300872) (← links)
