On sequential composition, action prefixes and process prefix

DOI10.1007/BF01215407zbMath0942.68608MaRDI QIDQ1333405

Jan A. Bergstra, Jos C. M. Baeten

Publication date: 14 August 2000

Published in: Formal Aspects of Computing (Search for Journal in Brave)

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Specification and verification (program logics, model checking, etc.) (68Q60) Abstract data types; algebraic specification (68Q65)

Related Items (8)

On the expressiveness of choice quantification ⋮ Refinement-oriented probability for CSP ⋮ Discrete time process algebra with abstraction ⋮ Logic of transition systems ⋮ Discrete time process algebra ⋮ Revisiting sequential composition in process calculi ⋮ Network algebra for asynchronous dataflow^∗ ⋮ Embedding Untimed into Timed Process Algebra; the Case for Explicit Termination

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Modal logics for mobile processes
• Top-down design and the algebra of communicating processes
• Algebraic specifications of computable and semicomputable data types
• Global renaming operators in concrete process algebra
• A calculus of communicating systems
• A calculus of mobile processes. I
• Process algebra with guards: Combining hoare logic with process algebra
• Proof systems for message-passing process algebras
• Process algebra for synchronous communication
• A Theory of Communicating Sequential Processes
• Process Algebra
• Communicating sequential processes
• Processes and the denotational semantics of concurrency

This page was built for publication: On sequential composition, action prefixes and process prefix