On the reachability problem for 5-dimensional vector addition systems
From MaRDI portal
Cites work
Cited in
(86)- An approach to automating the verification of compact parallel coordination programs. I
- Normal Petri nets
- Some complexity bounds for problems concerning finite and 2-dimensional vector addition systems with states
- Completeness results for conflict-free vector replacement systems
- Problems concerning fairness and temporal logic for conflict-free Petri nets
- A unified approach for deciding the existence of certain petri net paths
- The context-freeness of the languages associated with vector addition systems is decidable
- A structure to decide reachability in Petri nets
- Normal and sinkless Petri nets
- Deciding a class of path formulas for conflict-free Petri nets
- Speed faults in computation by chemical reaction networks
- Parameterized verification of monotone information systems
- A multiparameter analysis of the boundedness problem for vector addition systems
- Boundedness, empty channel detection, and synchronization for communicating finite automata
- Projections of vector addition system reachability sets are semilinear
- Catalytic P systems, semilinear sets, and vector addition systems
- Bounded self-stabilizing Petri nets
- Linear logic automata
- The computational power of population protocols
- Flat Petri nets (invited talk)
- The polynomial complexity of vector addition systems with states
- Data flow analysis of asynchronous systems using infinite abstract domains
- Alternating two-way AC-tree automata
- Context-free commutative grammars with integer counters and resets
- Real-time verification techniques for untimed systems
- The invariance problem for matrix semigroups
- Generative power of matrix insertion-deletion systems with context-free insertion or deletion
- Robustness of expressivity in chemical reaction networks
- Purely Catalytic P Systems over Integers and Their Generative Power
- Parikh images of matrix ins-del systems
- Guiding Craig interpolation with domain-specific abstractions
- Minimalist grammars in the light of logic
- Petri nets and semilinear sets (extended abstract)
- Universality in Molecular and Cellular Computing
- Metric propositional neighborhood logic with an equivalence relation
- PATH DECOMPOSITION AND SEMILINEARITY OF PETRI NETS
- Decidability of k-Soundness for Workflow Nets with an Unbounded Resource
- On selective unboundedness of VASS
- Vector Groups and the Equality Problem for Vector Addition Systems
- On the boundedness property of semilinear sets
- Regular separability of one counter automata
- Analyzing Reachability for Some Petri Nets With Fast Growing Markings
- Polynomial vector addition systems with states
- Concurrent games and semi-random determinacy
- Affine extensions of integer vector addition systems with states
- On the expressive power of non-deterministic and unambiguous Petri nets over infinite words
- scientific article; zbMATH DE number 7559493 (Why is no real title available?)
- Flatness and Complexity of Immediate Observation Petri Nets
- scientific article; zbMATH DE number 7559504 (Why is no real title available?)
- Reachability for two-counter machines with one test and one reset
- New pumping technique for 2-dimensional VASS
- High undecidability of weak bisimilarity for Petri nets
- Affine extensions of integer vector addition systems with states
- Exhibition of a structural bug with wings
- ON VARIOUS NOTIONS OF PARALLELISM IN P SYSTEMS
- ON ONE-MEMBRANE P SYSTEMS OPERATING IN SEQUENTIAL MODE
- Investigations on the power of matrix insertion-deletion systems with small sizes
- Democratic, existential, and consensus-based output conventions in stable computation by chemical reaction networks
- Coverability in 2-VASS with one unary counter is in NP
- Computing with chemical reaction networks: a tutorial
- Fast termination and workflow nets
- On the sum of chemical reactions
- Ackermannian completion of separators
- Counter abstraction for regular open teams
- Undecidability of bisimilarity for Petri nets and some related problems
- Vector addition systems reachability problem (a simpler solution)
- Flattability of priority vector addition systems
- On the containment problem for deterministic multicounter machine models
- Coverability in VASS revisited: improving Rackoff's bounds to obtain conditional optimality
- Presheaf automata
- Reachability in restricted chemical reaction networks
- Counter machines with infrequent reversals
- Parameterized model-checking of discrete-timed networks and symmetric-broadcast systems
- Asymptotic complexity estimates for probabilistic programs and their VASS abstractions
- Monus semantics in vector addition systems with states
- Reachability solution characterization of parametric real-time systems
- Challenges of the reachability problem in infinite-state systems (invited paper)
- Improved lower bounds for reachability in vector addition systems
- Boundedness of cost register automata over the integer min-plus semiring
- Box-reachability in vector addition systems
- Knowing-how reasoning with budgets recasted: universal reachability problem on VASS
- On the reachability problem for two-dimensional branching VASS
- Regular model checking for systems with effectively regular reachability relation
- Wait-only broadcast protocols are easier to verify
- Bridging the gap between plain VASS and branching VASS
- The controllability of vector addition systems
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)
