A proof of the Kahn principle for input/output automata

DOI10.1016/0890-5401(89)90066-7zbMath0679.68119OpenAlexW2152364675MaRDI QIDQ1822994

Eugene W. Stark, Nancy A. Lynch

Publication date: 1989

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0890-5401(89)90066-7

zbMATH Keywords

input/output automatanondeterministic processesinput/output relationKahn's fixed-point principlemodel of networks

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60) Theory of operating systems (68N25)

Related Items (14)

Connections between a concrete and an abstract model of concurrent systems ⋮ Stability, sequentiality and demand driven evaluation in dataflow ⋮ On schematological equivalence of partially interpreted dataflow networks ⋮ Linear dynamic Kahn networks are deterministic ⋮ First-order axioms for asynchrony ⋮ Equational reasoning about nondeterministic processes ⋮ The expressive power of indeterminate dataflow primitives ⋮ Concurrency in synchronous systems ⋮ Liveness in timed and untimed systems ⋮ Algebraic specification of reactive systems ⋮ Refinement of time ⋮ Trace and testing equivalence on asynchronous processes ⋮ Nonexpressibility of fairness and signaling ⋮ Historical introduction to ``Concrete domains by G. Kahn and G. D. Plotkin

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A proof of the Kahn principle for input/output automata