A note on transition systems
From MaRDI portal
Publication:1230656
DOI10.1016/0020-0255(76)90054-2zbMath0338.68044OpenAlexW4235163406MaRDI QIDQ1230656
Publication date: 1976
Published in: Information Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0020-0255(76)90054-2
Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45) Algorithms in computer science (68W99)
Related Items
Reversible computation in nets with bonds, A collective interpretation semantics for reversing Petri nets, A pure labeled transition semantics for the applied pi calculus, Computational Complexity of Atomic Chemical Reaction Networks, Unnamed Item, Structure theory of equal conflict systems, A Framework for Classical Petri Net Problems: Conservative Petri Nets as an Application, Complexity of some problems in Petri nets
Cites Work