Asynchronous process calculi: The first- and higher-order paradigms

DOI10.1016/S0304-3975(00)00097-9zbMath0956.68081WikidataQ126550517 ScholiaQ126550517MaRDI QIDQ1589656

Davide Sangiorgi

Publication date: 12 December 2000

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

full abstraction; asynchrony; first- and higher-order process calculi

Mathematics Subject Classification ID

68Q55: Semantics in the theory of computing

Related Items

Congruence Results of Scope Equivalence for a Graph Rewriting Model of Concurrent Programs, Higher-order psi-calculi, \(\pi\)-calculus, internal mobility, and agent-passing calculi, Locality and interleaving semantics in calculi for mobile processes, Theory of interaction, Some congruence properties for \(\pi\)-calculus bisimilarities, Partial confluence of processes and systems of objects, Process calculus based upon evaluation to committed form, On the expressiveness of internal mobility in name-passing calculi, On transformations of concurrent-object programs, On bisimulations for the asynchronous \(\pi\)-calculus, Bisimulations for a calculus of broadcasting systems, Non-interleaving semantics for mobile processes, Nonaxiomatisability of equivalences over finite state processes, On the representation of McCarthy's \(amb\) in the \(\pi\)-calculus, A calculus for reasoning about software composition, Abstractions for fault-tolerant global computing, Variations on mobile processes, The name discipline of uniform receptiveness, On the relative expressiveness of higher-order session processes, Bisimulation and coinduction enhancements: a historical perspective, Types and full abstraction for polyadic \(\pi\)-calculus, On the Relative Expressiveness of Higher-Order Session Processes

Uses Software

• Facile
• Pict

Cites Work

• Unnamed Item
• Unnamed Item
• \(\pi\)-calculus, internal mobility, and agent-passing calculi
• Bisimulation for higher-order process calculi
• Deciding bisimulation equivalences for a class of non-finite-state programs
• Plain CHOCS. A second generation calculus for higher order processes
• On reduction-based process semantics
• Algebraic theories for name-passing calculi
• Proving congruence of bisimulation in functional programming languages
• The name discipline of uniform receptiveness
• A theory of weak bisimulation for core CML
• Impossibility of distributed consensus with one faulty process
• Functions as processes
• Barbed bisimulation
• On bisimulations for the asynchronous π-calculus
• On the expressiveness of internal mobility in name-passing calculi
• Decoding choice encodings