A note on transition systems

DOI10.1016/0020-0255(76)90054-2MaRDI QIDQ1230656zbMATH OpenOpenAlexFDO

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

Mathematics Subject Classification ID

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

Cites work

• scientific article; zbMATH DE number 3314878 (Why is no real title available?)
• scientific article; zbMATH DE number 3343634 (Why is no real title available?)
• scientific article; zbMATH DE number 3356176 (Why is no real title available?)
• Marked directed graphs
• On Context-Free Languages
• Operating Experience with ALGOL 60
• Parallel program schemata
• Properties of a Model for Parallel Computations: Determinacy, Termination, Queueing
• Regenerative Simulation of a Queuing Model of an Automated Tape Library

Cited in

(7)

• Reversible computation in nets with bonds
• A collective interpretation semantics for reversing Petri nets
• Token multiplicity in reversing Petri nets under the individual token interpretation
• A pure labeled transition semantics for the applied pi calculus
• 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

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)