scientific article; zbMATH DE number 177823

MaRDI QIDQ4038701zbMATH OpenFDO

Authors Prakash Panangaden, Vasant Shanbhogue, Eugene W. Stark

Publication date 18 May 1993

zbMATH Keywords

transition graphsdataflow-like networks of communicating processesdeterminate automata

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Network design and communication in computer systems (68M10) Semantics in the theory of computing (68Q55)

Recommendations

• A proof of the Kahn principle for input/output automata
• scientific article; zbMATH DE number 4060692
• Communicating Sequential Processes. The First 25 Years
• The algebra of stream processing functions
• Publication:4733393

Cited in

(16)

• Turing machines, transition systems, and interaction
• Languages and logical definability in concurrency monoids
• Towards a complete hierarchy of compositional dataflow models
• Asynchronous games. II: The true concurrency of innocence
• Representation of computations in concurrent automata by dependence orders
• Turing machines, transition systems, and interaction
• scientific article; zbMATH DE number 1759408 (Why is no real title available?)
• scientific article; zbMATH DE number 517054 (Why is no real title available?)
• Historical introduction to ``Concrete domains by G. Kahn and G. D. Plotkin
• scientific article; zbMATH DE number 1678384 (Why is no real title available?)
• From sequential specifications to eventual consistency
• Directed homotopy in non-positively curved spaces
• Stability, sequentiality and demand driven evaluation in dataflow
• Nonexpressibility of fairness and signaling
• A proof of the Kahn principle for input/output automata
• scientific article; zbMATH DE number 4060692 (Why is no real title available?)

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4038701)