scientific article; zbMATH DE number 177823

zbMATH Open0766.68090MaRDI QIDQ4038701FDOQ4038701

Authors: Prakash Panangaden, Vasant Shanbhogue, Eugene W. Stark 

Publication date: 18 May 1993

Title of this publication is not available (Why is that?)

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

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)

Cited In (16)

• Languages and logical definability in concurrency monoids
• Turing machines, transition systems, and interaction
• Towards a complete hierarchy of compositional dataflow models
• Asynchronous games. II: The true concurrency of innocence
• Turing machines, transition systems, and interaction
• Representation of computations in concurrent automata by dependence orders
• Title not available (Why is that?)
• Title not available (Why is that?)
• Historical introduction to ``Concrete domains by G. Kahn and G. D. Plotkin
• Title not available (Why is that?)
• 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
• Title not available (Why is that?)
• A proof of the Kahn principle for input/output automata

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)