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

DOI10.1016/S0890-5401(03)00052-XzbMath1028.68094MaRDI QIDQ1398368

Anna Ingólfsdóttir

Publication date: 29 July 2003

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

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)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Late and early semantics coincide for testing
• Bisimulation and divergence
• Calculi for synchrony and asynchrony
• On powerdomains and modality
• A calculus of communicating systems
• Domain theory in logical form
• A calculus of mobile processes. II
• A theory of communicating processes with value passing
• A fully abstract denotational model for higher-order processes
• A fully abstract model for the \(\pi\)-calculus.
• A fully abstract denotational semantics for the \(\pi\)-calculus
• Proof systems for message-passing process algebras
• A domain equation for bisimulation
• A lattice-theoretical fixpoint theorem and its applications
• A term model for synchronous processes
• A Powerdomain Construction
• Initial Algebra Semantics and Continuous Algebras
• Communicating sequential processes
• Concurrent Processes and Their Syntax
• Termination, deadlock, and divergence
• Processes and the denotational semantics of concurrency
• From π-calculus to higher-order π-calculus — and back