Revisiting sequential composition in process calculi

DOI10.1016/j.jlamp.2015.08.001zbMath1330.68201OpenAlexW1411866384MaRDI QIDQ890611

Hubert Garavel

Publication date: 10 November 2015

Published in: Journal of Logical and Algebraic Methods in Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jlamp.2015.08.001

zbMATH Keywords

formal semanticsprocess algebraformal specificationprocess calculusconcurrency theorysequential composition

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (1)

Translation of CCS into CSP, correct up to strong bisimulation

Uses Software

• mCRL2
• MoDeST
• LOTOS
• E-LOTOS
• CADP
• Fiacre
• FDR2
• FDR3
• LNT2LOTOS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Redesign of a systems engineering language: formalisation of \(\chi\)
• Algèbre de processus et synchronisation
• An operational semantics of occam
• On the semantics of communicating hardware processes and their translation into LOTOS for the verification of asynchronous circuits with CADP
• A complete inference system for a class of regular behaviours
• Algebra of communicating processes with abstraction
• Compiling communicating processes into delay-insensitive VLSI circuits
• A calculus of communicating systems
• A proof system for communicating processes with value-passing
• A theory of communicating processes with value passing
• Process algebra with guards: Combining hoare logic with process algebra
• On sequential composition, action prefixes and process prefix
• Adding action refinement to a finite process algebra
• The algebra of communicating processes with empty process
• A general conservative extension theorem in process algebras with inequalities
• Proof systems for message-passing process algebras
• The origins of structural operational semantics
• A structural approach to operational semantics
• Comparing syntactic and semantic action refinement
• Models of nondeterministic regular expressions
• A compositional modelling and analysis framework for stochastic hybrid systems
• Understanding concurrent systems
• Towards action-refinement in process algebras
• Syntax and consistent equation semantics of hybrid Chi
• Notions of bisimulation and congruence formats for SOS with data
• The laws of Occam programming
• Reflections on the Future of Concurrency Theory in General and Process Calculi in Particular
• A Process Algebra for Wireless Mesh Networks
• PSF - A Retrospective
• A characterization of regular expressions under bisimulation
• Typestate: A programming language concept for enhancing software reliability
• A Theory of Communicating Sequential Processes
• Process Algebra
• Guarded commands, nondeterminacy and formal derivation of programs
• Communicating sequential processes
• A completeness theorem for nondeterministic Kleene algebras
• An Overview of the mCRL2 Toolset and Its Recent Advances
• FDR3 — A Modern Refinement Checker for CSP
• Formal Modeling and Analysis of Timed Systems
• The semantics of priority and fairness in occam
• Linearization in parallel pCRL

This page was built for publication: Revisiting sequential composition in process calculi