Global renaming operators in concrete process algebra

DOI10.1016/0890-5401(88)90027-2zbMath0651.68031OpenAlexW2136133653MaRDI QIDQ1106660

Jos C. M. Baeten, Jan A. Bergstra

Publication date: 1988

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://dspace.library.uu.nl/handle/1874/12722

zbMATH Keywords

process algebraside effectrenaming operatorstrace set

Mathematics Subject Classification ID

Abstract data types; algebraic specification (68Q65) Theory of operating systems (68N25)

Related Items (32)

Real space process algebra ⋮ Process algebra with guards: Combining hoare logic with process algebra ⋮ Axiomatizing GSOS with termination ⋮ On sequential composition, action prefixes and process prefix ⋮ Global renaming operators in concrete process algebra ⋮ Preferential choice and coordination conditions ⋮ Hiding in stream semantics of uniform concurrency ⋮ Timing and causality in process algebra ⋮ Congruence from the operator's point of view. Syntactic requirements on modal characterizations ⋮ The algebra of communicating processes with empty process ⋮ A general conservative extension theorem in process algebras with inequalities ⋮ Process algebra with propositional signals ⋮ Process algebra with language matching ⋮ Two finite specifications of a queue ⋮ Bounded stacks, bags and queues ⋮ Refinement in Interworkings ⋮ Structural operational semantics through context-dependent behaviour ⋮ SOS rule formats for idempotent terms and idempotent unary operators ⋮ Algebraic and fixed point equations over inverse limits of algebras ⋮ Process expressions and Hoare's logic: Showing and irreconcilability of context-free recursion with Scott's induction rule ⋮ Transition system specifications with negative premises ⋮ Structured operational semantics and bisimulation as a congruence ⋮ Using Hoare Logic in a Process Algebra Setting ⋮ An algebra for process creation ⋮ Rule formats for distributivity ⋮ Hybrid process algebra ⋮ SOS rule formats for zero and unit elements ⋮ A semantics for behavior trees using CSP with specification commands ⋮ Splitting bisimulations and retrospective conditions ⋮ Non-regular iterators in process algebra ⋮ Modular specification of process algebras ⋮ Recursive process definitions with the state operator

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Determinacy \(\to\) (observation equivalence \(=\) trace equivalence)
• Algebra of communicating processes with abstraction
• Top-down design and the algebra of communicating processes
• On the consistency of Koomen's fair abstraction rule
• Global renaming operators in concrete process algebra
• A calculus of communicating systems
• An axiomatic proof technique for parallel programs
• Process algebra for synchronous communication
• A Theory of Communicating Sequential Processes
• Readies and Failures in the Algebra of Communicating Processes
• Communicating sequential processes
• Processes and the denotational semantics of concurrency

This page was built for publication: Global renaming operators in concrete process algebra