Pages that link to "Item:Q1242682"
From MaRDI portal
The following pages link to The covering and boundedness problems for vector addition systems (Q1242682):
Displaying 50 items.
- Forward analysis and model checking for trace bounded WSTS (Q290914) (← links)
- On selective unboundedness of VASS (Q355513) (← links)
- The reachability problem for branching vector addition systems requires doubly-exponential space (Q407525) (← links)
- Aeolus: a component model for the cloud (Q476172) (← links)
- Verification of membrane systems with delays via Petri nets with delays (Q496035) (← links)
- Linear time analysis of properties of conflict-free and general Petri nets (Q620942) (← links)
- Extensional Petri net (Q667521) (← links)
- Reachability solution characterization of parametric real-time systems (Q703513) (← links)
- Linear reachability problems and minimal solutions to linear Diophantine equation systems (Q703515) (← links)
- Multiset rewriting for the verification of depth-bounded processes with name binding (Q714507) (← links)
- The residue of vector sets with applications to decidability problems in Petri nets (Q797285) (← links)
- Global and local views of state fairness (Q804304) (← links)
- A taxonomy of fairness and temporal logic problems for Petri nets (Q805257) (← links)
- A polynomial time algorithm to decide pairwise concurrency of transitions for 1-bounded conflict-free Petri nets (Q809611) (← links)
- Untanglings: a novel approach to analyzing concurrent systems (Q903488) (← links)
- EXPSPACE lower bounds for the simulation preorder between a communication-free Petri net and a finite-state system (Q989507) (← links)
- On minimal elements of upward-closed sets (Q1019726) (← links)
- Complexity of certain decision problems about congruential languages (Q1085618) (← links)
- An \(O(n^{1.5})\) algorithm to decide boundedness for conflict-free vector replacement systems (Q1097037) (← links)
- The complexity of reachability in distributed communicating processes (Q1098622) (← links)
- Petri nets and regular languages (Q1158763) (← 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)
- Normal and sinkless Petri nets (Q1208921) (← links)
- Deciding a class of path formulas for conflict-free Petri nets (Q1364130) (← links)
- On the finite containment problem for Petri nets (Q1819937) (← links)
- A multiparameter analysis of the boundedness problem for vector addition systems (Q1819938) (← links)
- Boundedness, empty channel detection, and synchronization for communicating finite automata (Q1819939) (← links)
- The complexity of the word problems for commutative semigroups and polynomial ideals (Q1836661) (← links)
- Optimal algorithms for the coverability, the subword, the containment, and the equivalence problems for commutative semigroups. (Q1854344) (← links)
- Bounded self-stabilizing Petri nets (Q1892714) (← links)
- On termination and invariance for faulty channel machines (Q1941874) (← links)
- Small vertex cover makes Petri net coverability and boundedness easier (Q1949744) (← links)
- Quasi-static scheduling of communicating tasks (Q1959479) (← links)
- Process calculi as a tool for studying coordination, contracts and session types (Q1987732) (← links)
- Parameterized verification of coverability in infinite state broadcast networks (Q2029598) (← links)
- \(K\)-diagnosability analysis of bounded and unbounded Petri nets using linear optimization (Q2103666) (← links)
- A counter abstraction technique for verifying properties of probabilistic swarm systems (Q2124442) (← links)
- Waiting nets (Q2165233) (← links)
- On detectability of labeled Petri nets and finite automata (Q2197590) (← links)
- The polynomial complexity of vector addition systems with states (Q2200853) (← links)
- Data flow analysis of asynchronous systems using infinite abstract domains (Q2233447) (← links)
- Checking robustness between weak transactional consistency models (Q2233450) (← links)
- Directed reachability for infinite-state systems (Q2233488) (← links)
- Strategic reasoning with a bounded number of resources: the quest for tractability (Q2238736) (← links)
- Strategy synthesis for multi-dimensional quantitative objectives (Q2249657) (← links)
- Combining free choice and time in Petri nets (Q2291812) (← links)
- Structural liveness of Petri nets is \textsc{ExpSpace}-hard and decidable (Q2317836) (← links)
- Some complexity results for stateful network verification (Q2335903) (← links)
- Taming past LTL and flat counter systems (Q2346416) (← links)
