Semantics of finite and infinite networks of concurrent communicating agents

DOI10.1007/BF01786252zbMath0621.68012OpenAlexW2050321215MaRDI QIDQ1090105

Manfred Broy

Publication date: 1987

Published in: Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01786252

zbMATH Keywords

fixed point theorydenotational semanticsdenotational models for stream-processing networks

Mathematics Subject Classification ID

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

Related Items (8)

Fairness, Resources, and Separation ⋮ On nets, algebras and modularity ⋮ Equational reasoning about nondeterministic processes ⋮ Specification and design of shared resource arbitration ⋮ The algebra of stream processing functions ⋮ Towards a formal foundation of the specification and description language SDL ⋮ Algebraic specification of reactive systems ⋮ Automated analysis of fault-tolerance in distributed systems

Cites Work

• Unnamed Item
• Partial abstract types
• A Powerdomain Construction
• Can programming be liberated from the von Neumann style?

This page was built for publication: Semantics of finite and infinite networks of concurrent communicating agents