Linearity, persistence and testing semantics in the asynchronous pi-calculus

DOI10.1016/J.ENTCS.2007.11.006MaRDI QIDQ2864372zbMATH OpenOpenAlexFDO

Authors Diletta Cacciagrano, Jesús Aranda, Frank D. Valencia, Flavio Corradini

Publication date 6 December 2013

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.2007.11.006

zbMATH Keywords

persistencelinearitytesting semanticsasynchronous pi-calculus

Mathematics Subject Classification ID

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

Recommendations

• Separation of synchronous and asynchronous communication via testing
• Separation of synchronous and asynchronous communication via testing
• On bisimulations for the asynchronous π-calculus
• On the Asynchronous Nature of the Asynchronous π-Calculus
• scientific article; zbMATH DE number 1223739

Cites work

• scientific article; zbMATH DE number 42752 (Why is no real title available?)
• scientific article; zbMATH DE number 1223739 (Why is no real title available?)
• scientific article; zbMATH DE number 2044505 (Why is no real title available?)
• scientific article; zbMATH DE number 2059568 (Why is no real title available?)
• scientific article; zbMATH DE number 1927581 (Why is no real title available?)
• A calculus of mobile processes. I
• Broadcast calculus interpreted in CCS upto bisimulation
• Foundations of Software Science and Computation Structures
• Foundations of Software Science and Computation Structures
• Leader election in rings of ambient processes
• Linear concurrent constraint programming: Operational and phase semantics
• On the computational strength of pure ambient calculi
• On the symbolic reduction of processes with cryptographic functions.
• Security protocols: from linear to classical logic by abstract interpretation
• Separation Results Via Leader Election Problems
• Separation of synchronous and asynchronous communication via testing
• Testing equivalences for processes
• The \(\pi\)-calculus: A theory of mobile processes
• The name discipline of uniform receptiveness
• Truly concurrent constraint programming
• What is a ``good encoding of guarded choice?

Cited in

(11)

• Separation of synchronous and asynchronous communication via testing
• Theory of interaction
• On the expressiveness of interaction
• Analysing and comparing encodability criteria
• From computing to interaction: on the expressiveness of asynchronous pi-calculus
• scientific article; zbMATH DE number 1670841 (Why is no real title available?)
• scientific article; zbMATH DE number 7449992 (Why is no real title available?)
• Towards a unified approach to encodability and separation results for process calculi
• On the validity of encodings of the synchronous in the asynchronous \(\pi\)-calculus
• Separation of synchronous and asynchronous communication via testing
• Towards a Unified Approach to Encodability and Separation Results for Process Calculi

This page was built for publication: Linearity, persistence and testing semantics in the asynchronous pi-calculus

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