Revisiting sequential composition in process calculi

DOI10.1016/J.JLAMP.2015.08.001MaRDI QIDQ890611zbMATH OpenOpenAlexFDO

Authors 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

process algebraformal semanticsprocess calculusconcurrency theoryformal specificationsequential composition

Mathematics Subject Classification ID

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

Recommendations

• Reflections on the future of concurrency theory in general and process calculi in particular
• Sequential composition in the presence of intermediate termination (extended abstract)
• The \(\pi\)-calculus: An introduction
• The composability problem of the semantics of XYZ/BE-communicating processes
• Publication:3026331

Cites work

• scientific article; zbMATH DE number 4205976 (Why is no real title available?)
• scientific article; zbMATH DE number 4157900 (Why is no real title available?)
• scientific article; zbMATH DE number 3808928 (Why is no real title available?)
• scientific article; zbMATH DE number 3902017 (Why is no real title available?)
• scientific article; zbMATH DE number 4037177 (Why is no real title available?)
• scientific article; zbMATH DE number 4039251 (Why is no real title available?)
• scientific article; zbMATH DE number 42752 (Why is no real title available?)
• scientific article; zbMATH DE number 41788 (Why is no real title available?)
• scientific article; zbMATH DE number 177815 (Why is no real title available?)
• scientific article; zbMATH DE number 1231597 (Why is no real title available?)
• scientific article; zbMATH DE number 1354170 (Why is no real title available?)
• scientific article; zbMATH DE number 1973989 (Why is no real title available?)
• scientific article; zbMATH DE number 2087557 (Why is no real title available?)
• scientific article; zbMATH DE number 1884414 (Why is no real title available?)
• scientific article; zbMATH DE number 1412988 (Why is no real title available?)
• scientific article; zbMATH DE number 1418456 (Why is no real title available?)
• scientific article; zbMATH DE number 3894457 (Why is no real title available?)
• A Theory of Communicating Sequential Processes
• A calculus of communicating systems
• A characterization of regular expressions under bisimulation
• A complete inference system for a class of regular behaviours
• A completeness theorem for nondeterministic Kleene algebras
• A compositional modelling and analysis framework for stochastic hybrid systems
• A general conservative extension theorem in process algebras with inequalities
• A process algebra for wireless mesh networks
• A proof system for communicating processes with value-passing
• A structural approach to operational semantics
• A theory of communicating processes with value passing
• Action refinement.
• Adding action refinement to a finite process algebra
• Algebra of communicating processes with abstraction
• Algebraic meta-theory of processes with data
• Algèbre de processus et synchronisation
• An operational semantics of occam
• An overview of the mCRL2 toolset and its recent advances
• Communicating sequential processes
• Comparing syntactic and semantic action refinement
• Compiling communicating processes into delay-insensitive VLSI circuits
• FDR3 -- a modern refinement checker for CSP
• Formal Modeling and Analysis of Timed Systems
• Guarded commands, nondeterminacy and formal derivation of programs
• Linearization in parallel pCRL
• Modeling and analysis of communicating systems
• Models of nondeterministic regular expressions
• Notions of bisimulation and congruence formats for SOS with data
• On sequential composition, action prefixes and process prefix
• On the semantics of communicating hardware processes and their translation into LOTOS for the verification of asynchronous circuits with CADP
• PSF -- a retrospective
• Process Algebra
• Process algebra with guards: Combining hoare logic with process algebra
• Process algebra with recursive operations
• Proof systems for message-passing process algebras
• Redesign of a systems engineering language: formalisation of \(\chi\)
• Reflections on the future of concurrency theory in general and process calculi in particular
• Syntax and consistent equation semantics of hybrid Chi
• The algebra of communicating processes with empty process
• The laws of Occam programming
• The origins of structural operational semantics
• The semantics of priority and fairness in occam
• Towards action-refinement in process algebras
• Typestate: A programming language concept for enhancing software reliability
• Understanding concurrent systems

Cited in

(6)

• Translation of CCS into CSP, correct up to strong bisimulation
• scientific article; zbMATH DE number 1670469 (Why is no real title available?)
• scientific article; zbMATH DE number 4162248 (Why is no real title available?)
• Store locally, prove globally
• Sequential composition in the presence of intermediate termination (extended abstract)
• Compositionality Entails Sequentializability

Describes a project that uses

Uses Software

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q890611)