A decidability theorem for a class of vector-addition systems
From MaRDI portal
Publication:1216050
DOI10.1016/0020-0190(75)90020-4zbMath0302.68065OpenAlexW1970896297MaRDI QIDQ1216050
Publication date: 1975
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0020-0190(75)90020-4
Related Items
REGULAR STATE MACHINES, Sufficient conditions for the marked graph realisability of labelled transition systems, Some complexity bounds for problems concerning finite and 2-dimensional vector addition systems with states, An \(O(n^{1.5})\) algorithm to decide boundedness for conflict-free vector replacement systems, Performance evaluation of concurrent systems using conflict-free and persistent Petri nets, Deciding a class of path formulas for conflict-free Petri nets, Completeness results for conflict-free vector replacement systems, Problems concerning fairness and temporal logic for conflict-free Petri nets, Linear time analysis of properties of conflict-free and general Petri nets, The decidability of persistence for vector addition systems, Unnamed Item, Algebraic structure of some stochastic discrete event systems, with applications, QRT FIFO automata, breadth-first grammars and their relations, A unified approach for deciding the existence of certain petri net paths, Normal and sinkless Petri nets, Synthesis and reengineering of persistent systems, Commutative grammars, Complexity of some problems in Petri nets, Bounded choice-free Petri net synthesis: algorithmic issues, Efficient synthesis of weighted marked graphs with circular reachability graph, and beyond, State space axioms for T-systems, A polynomial time algorithm to decide pairwise concurrency of transitions for 1-bounded conflict-free Petri nets
Cites Work
