A note on transition systems

DOI10.1016/0020-0255(76)90054-2zbMath0338.68044OpenAlexW4235163406MaRDI QIDQ1230656

Y. Edmund Lien

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

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45) Algorithms in computer science (68W99)

Related Items (8)

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

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Parallel program schemata
• Marked directed graphs
• Operating Experience with ALGOL 60
• Regenerative Simulation of a Queuing Model of an Automated Tape Library
• Properties of a Model for Parallel Computations: Determinacy, Termination, Queueing
• On Context-Free Languages

This page was built for publication: A note on transition systems