A note on transition systems
From MaRDI portal
Publication:1230656
DOI10.1016/0020-0255(76)90054-2zbMATH Open0338.68044OpenAlexW4235163406MaRDI QIDQ1230656FDOQ1230656
Authors: 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
Formal languages and automata (68Q45) Analysis of algorithms and problem complexity (68Q25) Algorithms in computer science (68W99)
Cites Work
- Parallel program schemata
- On Context-Free Languages
- Marked directed graphs
- Title not available (Why is that?)
- Properties of a Model for Parallel Computations: Determinacy, Termination, Queueing
- Regenerative Simulation of a Queuing Model of an Automated Tape Library
- Title not available (Why is that?)
- Operating Experience with ALGOL 60
- Title not available (Why is that?)
Cited In (8)
- Reversible computation in nets with bonds
- Complexity of some problems in Petri nets
- A Framework for Classical Petri Net Problems: Conservative Petri Nets as an Application
- Title not available (Why is that?)
- Structure theory of equal conflict systems
- A pure labeled transition semantics for the applied pi calculus
- A collective interpretation semantics for reversing Petri nets
- Computational Complexity of Atomic Chemical Reaction Networks
This page was built for publication: A note on transition systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1230656)
