Algebraic theories for name-passing calculi
From MaRDI portal
Publication:1898459
DOI10.1006/inco.1995.1108zbMath0836.03020MaRDI QIDQ1898459
Joachim Parrow, Davide Sangiorgi
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
congruences; concurrency; process calculi; deterministic processes; bisimilarity equivalences; calculi for name-passing
68Q10: Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.)
03B70: Logic in computer science
68Q55: Semantics in the theory of computing
Related Items
Equivalence Checking for a Finite Higher Order π-Calculus, Minimality and separation results on asynchronous mobile processes -- representability theorems by concurrent combinators, On quasi-open bisimulation, Locality and interleaving semantics in calculi for mobile processes, Towards an algebraic theory of typed mobile processes, Reaction graph, On the expressiveness of internal mobility in name-passing calculi, Complete inference systems for weak bisimulation equivalences in the \(\pi\)-calculus., A fully abstract model for the \(\pi\)-calculus., A complexity analysis of bisimilarity for value-passing processes, Asynchronous process calculi: The first- and higher-order paradigms, Testing congruence for mobile processes, A fully abstract denotational semantics for the \(\pi\)-calculus, Proof systems for message-passing process algebras, Understanding the mismatch combinator in chi calculus, Tau laws for pi calculus, Variations on mobile processes, Inference systems for observation equivalences in the \(\pi\)-calculus
