Asynchronous process calculi: The first- and higher-order paradigms
From MaRDI portal
Publication:1589656
DOI10.1016/S0304-3975(00)00097-9zbMATH Open0956.68081OpenAlexW2024300530WikidataQ126550517 ScholiaQ126550517MaRDI QIDQ1589656FDOQ1589656
Authors: Davide Sangiorgi 
Publication date: 12 December 2000
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0304-3975(00)00097-9
Recommendations
- scientific article; zbMATH DE number 1223738
- A hierarchy of equivalences for asynchronous calculi
- On the Asynchronous Nature of the Asynchronous π-Calculus
- A coinductive calculus for asynchronous side-effecting processes
- A coinductive calculus for asynchronous side-effecting processes
- A novel asynchronous parallelism scheme for first-order logic
- scientific article; zbMATH DE number 3928334
- First-order axioms for asynchrony
- A fully parallel calculus of synchronizing processes
- scientific article; zbMATH DE number 1543081
Cites Work
- Functions as processes
- Bisimulation for higher-order process calculi
- Proving congruence of bisimulation in functional programming languages
- Impossibility of distributed consensus with one faulty process
- On reduction-based process semantics
- Barbed bisimulation
- \(\pi\)-calculus, internal mobility, and agent-passing calculi
- The name discipline of uniform receptiveness
- Deciding bisimulation equivalences for a class of non-finite-state programs
- Decoding choice encodings
- Algebraic theories for name-passing calculi
- Title not available (Why is that?)
- Plain CHOCS. A second generation calculus for higher order processes
- Title not available (Why is that?)
- On the expressiveness of internal mobility in name-passing calculi
- On bisimulations for the asynchronous π-calculus
- A theory of weak bisimulation for core CML
Cited In (28)
- Bisimulation and coinduction enhancements: a historical perspective
- Title not available (Why is that?)
- Minimality and separation results on asynchronous mobile processes -- representability theorems by concurrent combinators
- Abstractions for fault-tolerant global computing
- On bisimulations for the asynchronous \(\pi\)-calculus
- On the representation of McCarthy's \(amb\) in the \(\pi\)-calculus
- Process calculus based upon evaluation to committed form
- Some congruence properties for \(\pi\)-calculus bisimilarities
- Non-interleaving semantics for mobile processes
- On transformations of concurrent-object programs
- Partial confluence of processes and systems of objects
- Bisimulations for a calculus of broadcasting systems
- Types and full abstraction for polyadic \(\pi\)-calculus
- The name discipline of uniform receptiveness
- A calculus for concurrent system with higher-order streaming communication
- Higher-order psi-calculi
- Nonaxiomatisability of equivalences over finite state processes
- A hierarchy of equivalences for asynchronous calculi
- Title not available (Why is that?)
- On the relative expressiveness of higher-order session processes
- \(\pi\)-calculus, internal mobility, and agent-passing calculi
- Congruence Results of Scope Equivalence for a Graph Rewriting Model of Concurrent Programs
- On the Relative Expressiveness of Higher-Order Session Processes
- On the expressiveness of internal mobility in name-passing calculi
- Variations on mobile processes
- A calculus for reasoning about software composition
- Theory of interaction
- Locality and interleaving semantics in calculi for mobile processes
Uses Software
This page was built for publication: Asynchronous process calculi: The first- and higher-order paradigms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1589656)
