Minimality and separation results on asynchronous mobile processes -- representability theorems by concurrent combinators

DOI10.1016/S0304-3975(00)00310-8zbMath0992.68151MaRDI QIDQ5958469

Nobuko Yoshida

Publication date: 3 March 2002

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

zbMATH Keywords

semanticsasynchronous pi-calculuscombinatorsexpressive powersmobile processes

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Combinatory logic and lambda calculus (03B40)

Related Items (3)

Behavioral complexity indicators for process algebra: The NKS approach ⋮ Type-Based Security for Mobile Computing Integrity, Secrecy and Liveness ⋮ Expressiveness of Process Algebras

Uses Software

• Pict

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• \(\pi\)-calculus, internal mobility, and agent-passing calculi
• The lambda calculus. Its syntax and semantics. Rev. ed.
• A fully abstract semantics for causality in the \(\pi\)-calculus
• A calculus of mobile processes. II
• Fully abstract models of typed \(\lambda\)-calculi
• On the expressiveness of internal mobility in name-passing calculi
• Interaction combinators
• Objects in the \(\pi\)-calculus
• Algebraic theories for name-passing calculi
• Calculi for interaction
• Functions as processes
• A new implementation technique for applicative languages
• Elementary structures in process theory (1): Sets with renaming
• Game theoretic analysis of call-by-value computation
• Causality for mobile processes
• Interaction nets and term rewriting systems (extended abstract)
• On bisimulations for the asynchronous π-calculus
• Decoding choice encodings

This page was built for publication: Minimality and separation results on asynchronous mobile processes -- representability theorems by concurrent combinators