On the reachability problem for 5-dimensional vector addition systems
From MaRDI portal
Cites work
Cited in
(66)- Flatness and Complexity of Immediate Observation Petri Nets
- Petri nets and semilinear sets (extended abstract)
- A multiparameter analysis of the boundedness problem for vector addition systems
- Some complexity bounds for problems concerning finite and 2-dimensional vector addition systems with states
- Completeness results for conflict-free vector replacement systems
- Decidability of $$k$$-Soundness for Workflow Nets with an Unbounded Resource
- Undecidability of bisimilarity for Petri nets and some related problems
- Real-time verification techniques for untimed systems
- ON VARIOUS NOTIONS OF PARALLELISM IN P SYSTEMS
- scientific article; zbMATH DE number 7561336 (Why is no real title available?)
- Flat Petri nets (invited talk)
- Reachability solution characterization of parametric real-time systems
- Concurrent games and semi-random determinacy
- Alternating two-way AC-tree automata
- On the boundedness property of semilinear sets
- Generative power of matrix insertion-deletion systems with context-free insertion or deletion
- Boundedness, empty channel detection, and synchronization for communicating finite automata
- Parikh images of matrix ins-del systems
- Investigations on the power of matrix insertion-deletion systems with small sizes
- Bounded self-stabilizing Petri nets
- Guiding Craig interpolation with domain-specific abstractions
- Linear logic automata
- Affine extensions of integer vector addition systems with states
- Analyzing Reachability for Some Petri Nets With Fast Growing Markings
- Context-free commutative grammars with integer counters and resets
- The polynomial complexity of vector addition systems with states
- Catalytic P systems, semilinear sets, and vector addition systems
- Robustness of expressivity in chemical reaction networks
- Minimalist grammars in the light of logic
- Vector Groups and the Equality Problem for Vector Addition Systems
- New pumping technique for 2-dimensional VASS
- An approach to automating the verification of compact parallel coordination programs. I
- ON ONE-MEMBRANE P SYSTEMS OPERATING IN SEQUENTIAL MODE
- The computational power of population protocols
- Metric propositional neighborhood logic with an equivalence relation
- On the sum of chemical reactions
- Normal Petri nets
- A structure to decide reachability in Petri nets
- Normal and sinkless Petri nets
- Regular separability of one counter automata
- scientific article; zbMATH DE number 7407773 (Why is no real title available?)
- The invariance problem for matrix semigroups
- scientific article; zbMATH DE number 7559493 (Why is no real title available?)
- Ackermannian completion of separators
- Purely Catalytic P Systems over Integers and Their Generative Power
- Parameterized verification of monotone information systems
- PATH DECOMPOSITION AND SEMILINEARITY OF PETRI NETS
- Democratic, existential, and consensus-based output conventions in stable computation by chemical reaction networks
- Universality in Molecular and Cellular Computing
- Problems concerning fairness and temporal logic for conflict-free Petri nets
- The context-freeness of the languages associated with vector addition systems is decidable
- Coverability in 2-VASS with one unary counter is in NP
- On selective unboundedness of VASS
- Speed faults in computation by chemical reaction networks
- scientific article; zbMATH DE number 7559504 (Why is no real title available?)
- Projections of vector addition system reachability sets are semilinear
- Computing with chemical reaction networks: a tutorial
- Data flow analysis of asynchronous systems using infinite abstract domains
- Counter abstraction for regular open teams
- Deciding a class of path formulas for conflict-free Petri nets
- High undecidability of weak bisimilarity for Petri nets
- Polynomial vector addition systems with states
- Fast termination and workflow nets
- A unified approach for deciding the existence of certain petri net paths
- On the expressive power of non-deterministic and unambiguous Petri nets over infinite words
- Exhibition of a structural bug with wings
This page was built for publication: On the reachability problem for 5-dimensional vector addition systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1155361)
