Algebraic theories for name-passing calculi
From MaRDI portal
Publication:1898459
DOI10.1006/inco.1995.1108zbMath0836.03020OpenAlexW2072848882MaRDI QIDQ1898459
Davide Sangiorgi, Joachim Parrow
Publication date: 2 May 1996
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: http://urn.kb.se/resolve?urn=urn:nbn:se:ri:diva-22161
congruencesconcurrencyprocess calculideterministic processesbisimilarity equivalencescalculi for name-passing
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Logic in computer science (03B70) Semantics in the theory of computing (68Q55)
Related Items
Tau laws for pi calculus, A Behavioural Theory for a π-calculus with Preorders, Complete inference systems for weak bisimulation equivalences in the π-calculus, A behavioural theory for a \(\pi\)-calculus with preorders, Constraints as processes, Theory of interaction, Complete inference systems for weak bisimulation equivalences in the \(\pi\)-calculus., A fully abstract model for the \(\pi\)-calculus., Variations on mobile processes, Inference systems for observation equivalences in the \(\pi\)-calculus, Locality and interleaving semantics in calculi for mobile processes, On the expressiveness of internal mobility in name-passing calculi, On quasi-open bisimulation, Minimality and separation results on asynchronous mobile processes -- representability theorems by concurrent combinators, Equivalence Checking for a Finite Higher Order π-Calculus, A thesis for interaction, Proof systems for message-passing process algebras, The λ-calculus in the π-calculus, Reaction graph, On the expressiveness of internal mobility in name-passing calculi, A complexity analysis of bisimilarity for value-passing processes, The Value-Passing Calculus, Asynchronous process calculi: The first- and higher-order paradigms, Understanding the mismatch combinator in chi calculus, Testing congruence for mobile processes, A fully abstract denotational semantics for the \(\pi\)-calculus, Towards an algebraic theory of typed mobile processes
