A decidability theorem for a class of vector-addition systems
From MaRDI portal
Publication:1216050
DOI10.1016/0020-0190(75)90020-4zbMath0302.68065MaRDI 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
DB lookup for MSC labels failed
Related Items
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, Deciding a class of path formulas for conflict-free Petri nets