A decidability theorem for a class of vector-addition systems
From MaRDI portal
(Redirected from Publication:1216050)
Cites work
Cited in
(22)- Some complexity bounds for problems concerning finite and 2-dimensional vector addition systems with states
- Completeness results for conflict-free vector replacement systems
- Complexity of some problems in Petri nets
- Sufficient conditions for the marked graph realisability of labelled transition systems
- Performance evaluation of concurrent systems using conflict-free and persistent Petri nets
- Synthesis and reengineering of persistent systems
- State space axioms for T-systems
- Efficient synthesis of weighted marked graphs with circular reachability graph, and beyond
- The decidability of persistence for vector addition systems
- Bounded choice-free Petri net synthesis: algorithmic issues
- QRT FIFO automata, breadth-first grammars and their relations
- Commutative grammars
- REGULAR STATE MACHINES
- Normal and sinkless Petri nets
- Algebraic structure of some stochastic discrete event systems, with applications
- An \(O(n^{1.5})\) algorithm to decide boundedness for conflict-free vector replacement systems
- Problems concerning fairness and temporal logic for conflict-free Petri nets
- scientific article; zbMATH DE number 3628412 (Why is no real title available?)
- Deciding a class of path formulas for conflict-free Petri nets
- Linear time analysis of properties of conflict-free and general Petri nets
- A polynomial time algorithm to decide pairwise concurrency of transitions for 1-bounded conflict-free Petri nets
- A unified approach for deciding the existence of certain petri net paths
This page was built for publication: A decidability theorem for a class of vector-addition systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1216050)
