Revisiting sequential composition in process calculi

DOI10.1016/J.JLAMP.2015.08.001zbMATH Open1330.68201OpenAlexW1411866384MaRDI QIDQ890611FDOQ890611

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

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

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)

Cites Work

• Title not available (Why is that?)
• A structural approach to operational semantics
• Syntax and consistent equation semantics of hybrid Chi
• Notions of bisimulation and congruence formats for SOS with data
• Title not available (Why is that?)
• Title not available (Why is that?)
• Algebraic meta-theory of processes with data
• Algebra of communicating processes with abstraction
• A calculus of communicating systems
• Communicating sequential processes
• Title not available (Why is that?)
• A process algebra for wireless mesh networks
• Title not available (Why is that?)
• 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
• Title not available (Why is that?)
• Algèbre de processus et synchronisation
• Understanding concurrent systems
• Reflections on the future of concurrency theory in general and process calculi in particular
• Title not available (Why is that?)
• Modeling and analysis of communicating systems
• An overview of the mCRL2 toolset and its recent advances
• FDR3 -- a modern refinement checker for CSP
• A complete inference system for a class of regular behaviours
• The origins of structural operational semantics
• The algebra of communicating processes with empty process
• Title not available (Why is that?)
• Title not available (Why is that?)
• Process algebra with recursive operations
• Compiling communicating processes into delay-insensitive VLSI circuits
• A proof system for communicating processes with value-passing
• Proof systems for message-passing process algebras
• Redesign of a systems engineering language: formalisation of \(\chi\)
• The laws of Occam programming
• A theory of communicating processes with value passing
• Process algebra with guards: Combining hoare logic with process algebra
• Title not available (Why is that?)
• Action refinement.
• Title not available (Why is that?)
• Comparing syntactic and semantic action refinement
• Towards action-refinement in process algebras
• Title not available (Why is that?)
• Title not available (Why is that?)
• Adding action refinement to a finite process algebra
• A compositional modelling and analysis framework for stochastic hybrid systems
• Linearization in parallel pCRL
• On the semantics of communicating hardware processes and their translation into LOTOS for the verification of asynchronous circuits with CADP
• On sequential composition, action prefixes and process prefix
• A general conservative extension theorem in process algebras with inequalities
• Models of nondeterministic regular expressions
• PSF -- a retrospective
• Title not available (Why is that?)
• A characterization of regular expressions under bisimulation
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• A completeness theorem for nondeterministic Kleene algebras
• Formal Modeling and Analysis of Timed Systems
• The semantics of priority and fairness in occam
• An operational semantics of occam

Cited In (6)

• Title not available (Why is that?)
• Title not available (Why is that?)
• Translation of CCS into CSP, correct up to strong bisimulation
• Store locally, prove globally
• Sequential composition in the presence of intermediate termination (extended abstract)
• Compositionality Entails Sequentializability

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)