Pages that link to "Item:Q1155361"
From MaRDI portal
The following pages link to On the reachability problem for 5-dimensional vector addition systems (Q1155361):
Displaying 50 items.
- Guiding Craig interpolation with domain-specific abstractions (Q300418) (← links)
- Metric propositional neighborhood logic with an equivalence relation (Q329414) (← links)
- On selective unboundedness of VASS (Q355513) (← links)
- Undecidability of bisimilarity for Petri nets and some related problems (Q672326) (← links)
- Reachability solution characterization of parametric real-time systems (Q703513) (← links)
- An approach to automating the verification of compact parallel coordination programs. I (Q1056221) (← links)
- Normal Petri nets (Q1057065) (← links)
- Some complexity bounds for problems concerning finite and 2-dimensional vector addition systems with states (Q1096388) (← links)
- Completeness results for conflict-free vector replacement systems (Q1113674) (← links)
- Problems concerning fairness and temporal logic for conflict-free Petri nets (Q1121023) (← links)
- A unified approach for deciding the existence of certain petri net paths (Q1184737) (← links)
- The context-freeness of the languages associated with vector addition systems is decidable (Q1193880) (← links)
- A structure to decide reachability in Petri nets (Q1193891) (← links)
- Normal and sinkless Petri nets (Q1208921) (← links)
- Deciding a class of path formulas for conflict-free Petri nets (Q1364130) (← links)
- Speed faults in computation by chemical reaction networks (Q1689751) (← links)
- Parameterized verification of monotone information systems (Q1798673) (← 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)
- Projections of vector addition system reachability sets are semilinear (Q1823697) (← links)
- Catalytic P systems, semilinear sets, and vector addition systems (Q1884955) (← links)
- Bounded self-stabilizing Petri nets (Q1892714) (← links)
- Linear logic automata (Q1919766) (← links)
- The computational power of population protocols (Q1954251) (← links)
- Flat Petri nets (invited talk) (Q2117150) (← links)
- The polynomial complexity of vector addition systems with states (Q2200853) (← links)
- Data flow analysis of asynchronous systems using infinite abstract domains (Q2233447) (← links)
- Alternating two-way AC-tree automata (Q2373699) (← links)
- Context-free commutative grammars with integer counters and resets (Q2636518) (← links)
- Real-time verification techniques for untimed systems (Q2703729) (← links)
- The Invariance Problem for Matrix Semigroups (Q2811359) (← links)
- Generative Power of Matrix Insertion-Deletion Systems with Context-Free Insertion or Deletion (Q2819137) (← links)
- Robustness of Expressivity in Chemical Reaction Networks (Q2835703) (← links)
- Purely Catalytic P Systems over Integers and Their Generative Power (Q2975904) (← links)
- Parikh Images of Matrix Ins-Del Systems (Q2988822) (← links)
- Minimalist Grammars in the Light of Logic (Q3013024) (← links)
- Petri Nets and Semilinear Sets (Extended Abstract) (Q3179388) (← links)
- Universality in Molecular and Cellular Computing (Q3195684) (← links)
- PATH DECOMPOSITION AND SEMILINEARITY OF PETRI NETS (Q3395130) (← links)
- Decidability of $$k$$-Soundness for Workflow Nets with an Unbounded Resource (Q3452466) (← links)
- Vector Groups and the Equality Problem for Vector Addition Systems (Q3877656) (← links)
- On the Boundedness Property of Semilinear Sets (Q4922123) (← links)
- (Q4968382) (← links)
- Analyzing Reachability for Some Petri Nets With Fast Growing Markings (Q4982096) (← links)
- (Q5002821) (← links)
- (Q5005142) (← links)
- (Q5009428) (← links)
- On the Expressive Power of Non-deterministic and Unambiguous Petri Nets over Infinite Words (Q5025066) (← links)
- (Q5089304) (← links)
- Flatness and Complexity of Immediate Observation Petri Nets (Q5089312) (← links)
