A semantic theory for value-passing processes based on the late approach

DOI10.1016/S0890-5401(03)00052-XMaRDI QIDQ1398368zbMATH OpenFDO

Authors Anna Ingolfsdottir

Publication date 29 July 2003

Published in Information and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0890-5401(03)00052-X

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• A symbolic approach to value-passing processes
• Symbolic bisimulations
• A presheaf semantics of value-passing processes
• scientific article; zbMATH DE number 177815
• The Value-Passing Calculus

Cites work

• A calculus of communicating systems
• A calculus of mobile processes. II
• A domain equation for bisimulation
• A fully abstract denotational model for higher-order processes
• A fully abstract denotational semantics for the \(\pi\)-calculus
• A fully abstract model for the \(\pi\)-calculus.
• A lattice-theoretical fixpoint theorem and its applications
• A Powerdomain Construction
• A term model for synchronous processes
• A theory of communicating processes with value passing
• Bisimulation and divergence
• Calculi for synchrony and asynchrony
• Communicating sequential processes
• Concurrent Processes and Their Syntax
• Domain theory in logical form
• From \(\pi \)-calculus to higher-order \(\pi \)-calculus -- and back
• scientific article; zbMATH DE number 3716792 (Why is no real title available?)
• scientific article; zbMATH DE number 3754002 (Why is no real title available?)
• scientific article; zbMATH DE number 42752 (Why is no real title available?)
• scientific article; zbMATH DE number 48630 (Why is no real title available?)
• scientific article; zbMATH DE number 3635472 (Why is no real title available?)
• Initial Algebra Semantics and Continuous Algebras
• Late and early semantics coincide for testing
• On powerdomains and modality
• Processes and the denotational semantics of concurrency
• Proof systems for message-passing process algebras
• Termination, deadlock, and divergence

Cited in

(3)

• A symbolic approach to value-passing processes
• Value-passing CCS with noisy channels
• Communicating processes with value-passing and assignments

This page was built for publication: A semantic theory for value-passing processes based on the late approach

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