scientific article; zbMATH DE number 3986627

MaRDI QIDQ3750114zbMATH OpenFDO

Authors Robin Milner

Publication date 1985

zbMATH Keywords

CCS calculusconcurrent computationsmodal logicobservational equivalencesemantics

Mathematics Subject Classification ID

Theory of operating systems (68N25) Semantics in the theory of computing (68Q55) Specification and verification (program logics, model checking, etc.) (68Q60)

Cited in

(22)

• Algebra of communicating processes with abstraction
• Concurrent and maximally concurrent evolution of nonsequential systems
• A context dependent equivalence between processes
• Concurrent histories: a basis for observing distributed systems
• A distributed operational semantics of CCS based on condition/event systems
• Equational properties of iteration in algebraically complete categories
• Control machines: A new model of parallelism for compositional specifications and their effective compilation
• The connection between an event structure semantics and an operational semantics for TCSP
• Linear time and branching time semantics for recursion with merge
• A process algebra of communicating shared resources with dense time and priorities
• The equational logic of fixed points
• Notes on the methodology of CCS and CSP
• Process algebra with propositional signals
• Unfolding and fixpoint semantics of concurrent constraint logic programs
• An algebraic view of interleaving and distributed operational semantics for CCS
• Deciding observational congruence of finite-state CCS expressions by rewriting
• Refinement of actions in event structures and causal trees
• Nets, sequential components and concurrency relations
• A\(^ 2\)CCS: Atomic actions for CCS
• A partial ordering semantics for CCS
• A rewriting strategy to verify observational congruence
• Petri nets are monoids

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 Q3750114)