A calculus of mobile processes. II
From MaRDI portal
Publication:1198549
DOI10.1016/0890-5401(92)90009-5zbMath0752.68037MaRDI QIDQ1198549
Publication date: 16 January 1993
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0890-5401(92)90009-5
process algebra; mobility; processes; labeled transition system; calculus of communicating systems; strong bisimilarity; strong equivalence; distinctions
68Q10: Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.)
68Q85: Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.)
Related Items
\(\pi\)-calculus, internal mobility, and agent-passing calculi, Filter models for conjunctive-disjunctive \(\lambda\)-calculi, Locality and interleaving semantics in calculi for mobile processes, A multiset semantics for the pi-calculus with replication, Late and early semantics coincide for testing, Modal logics for mobile processes, A process algebraic view of Linda coordination primitives, A process-calculus-based abstraction for coordinating multi-agent groups, Some congruence properties for \(\pi\)-calculus bisimilarities, A calculus of mobile processes. I, An algebraic verification of a mobile network, An interpretation of typed objects into typed \(\pi\)-calculus, A conservative look at operational semantics with variable binding, Multisets and structural congruence of the pi-calculus with replication, Partial confluence of processes and systems of objects, Process calculus based upon evaluation to committed form, A process algebra with distributed priorities, On transformations of concurrent-object programs, On bisimulations for the asynchronous \(\pi\)-calculus, Non-interleaving semantics for mobile processes, GSOS and finite labelled transition systems, Proofs as processes, On reduction-based process semantics, A \(\pi\)-calculus with explicit substitutions, On the decidability of process equivalences for the \(\pi\)-calculus, On modelling mobility, Mobile ambients, Types for access control, A complexity analysis of bisimilarity for value-passing processes, Linda-based applicative and imperative process algebras, Two decentralized algorithms for strong interaction fairness for systems with unbounded speed variability, A hidden agenda, On simulation, subtyping and substitutability in sequential object systems, Variations on mobile processes, Game-theoretic analysis of call-by-value computation, The name discipline of uniform receptiveness, A specification structure for deadlock-freedom of synchronous processes, Unnamed Item, Unnamed Item
Cites Work
