Expressiveness of process algebras

DOI10.1016/J.ENTCS.2008.04.011MaRDI QIDQ2870198zbMATH OpenOpenAlexFDO

Authors Joachim Parrow

Publication date 17 January 2014

Published in Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.entcs.2008.04.011

zbMATH Keywords

expressivenessprocess algebra

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Cites work

• Automata, Languages and Programming
• Decoding choice encodings
• From \(\pi \)-calculus to higher-order \(\pi \)-calculus -- and back
• Higher-level synchronising devices in Meije-SCCS
• scientific article; zbMATH DE number 1512624 (Why is no real title available?)
• scientific article; zbMATH DE number 1531624 (Why is no real title available?)
• Minimality and separation results on asynchronous mobile processes -- representability theorems by concurrent combinators
• On the consistency of Koomen's fair abstraction rule
• Separation of synchronous and asynchronous communication via testing
• What is a ``good encoding of guarded choice?

Cited in

(44)

• Comparing communication primitives via their relative expressive power
• Locality based semantics for process algebras
• Towards a unified approach to encodability and separation results for process calculi
• The \(C_\pi\)-calculus: a model for confidential name passing
• On primitives for compensation handling as adaptable processes
• Session-based concurrency, declaratively
• Expressiveness of concurrent intensionality
• Replacement freeness: a criterion for separating process calculi
• On the relative expressiveness of higher-order session processes
• CCS: it's not fair! Fair schedulers cannot be implemented in CCS-like languages even under progress and certain fairness assumptions
• Comparing type systems for deadlock freedom
• scientific article; zbMATH DE number 1638655 (Why is no real title available?)
• On the relative expressiveness of higher-order session processes
• Breaking symmetries
• Synchrony versus causality in distributed systems
• On the expressiveness of symmetric communication
• Comparing process calculi using encodings
• Towards a Unified Approach to Encodability and Separation Results for Process Calculi
• scientific article; zbMATH DE number 1189061 (Why is no real title available?)
• Reactive Turing machines
• scientific article; zbMATH DE number 139606 (Why is no real title available?)
• scientific article; zbMATH DE number 1337886 (Why is no real title available?)
• scientific article; zbMATH DE number 1484272 (Why is no real title available?)
• The true concurrency of differential interaction nets
• Contradiction-Tolerant Process Algebra with Propositional Signals
• scientific article; zbMATH DE number 1884420 (Why is no real title available?)
• A Logical Viewpoint on Process-algebraic Quotients
• scientific article; zbMATH DE number 937812 (Why is no real title available?)
• Interpreted Systems Semantics for Process Algebra with Identity Annotations
• scientific article; zbMATH DE number 1424056 (Why is no real title available?)
• scientific article; zbMATH DE number 7319030 (Why is no real title available?)
• On parameterization of higher-order processes
• Failure trace semantics for a process algebra with time-outs
• Analysing and comparing encodability criteria
• scientific article; zbMATH DE number 7204939 (Why is no real title available?)
• Full abstraction for expressiveness: history, myths and facts
• Underspecification for a simple process algebra of recursive processes.
• Translation of CCS into CSP, correct up to strong bisimulation
• On the expressiveness of mixed choice sessions
• Mixed choice in session types
• A taxonomy of process calculi for distribution and mobility
• Probabilistic operational correspondence
• Separation and encodability in mixed choice multiparty sessions
• On the semantic expressiveness of iso- and equi-recursive types

This page was built for publication: Expressiveness of process algebras

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