On the expressiveness of interaction

DOI10.1016/j.tcs.2009.11.011zbMath1191.68436OpenAlexW2170052897MaRDI QIDQ960859

Yuxi Fu, Lu, Hao

Publication date: 29 March 2010

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

Full work available at URL: https://doi.org/10.1016/j.tcs.2009.11.011

zbMATH Keywords

bisimulationexpressivenessprocess calculus

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (27)

Unnamed Item ⋮ Coupled similarity: the first 32 years ⋮ Reactive Turing machines ⋮ Translation of CCS into CSP, correct up to strong bisimulation ⋮ Distinguishing and relating higher-order and first-order processes by expressiveness ⋮ Theory of interaction ⋮ Parameterizing higher-order processes on names and processes ⋮ Breaking symmetries ⋮ Unnamed Item ⋮ Replacement freeness: a criterion for separating process calculi ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Extensional Petri net ⋮ MODELING AND ANALYSIS OF REAL-TIME SYSTEMS WITH MUTEX COMPONENTS ⋮ Non-deterministic structures of computation ⋮ Full abstraction for expressiveness: history, myths and facts ⋮ On the relative expressiveness of higher-order session processes ⋮ On the interactive power of higher-order processes extended with parameterization ⋮ On the Relative Expressiveness of Higher-Order Session Processes ⋮ Unnamed Item ⋮ Counting nondeterministic computations ⋮ A thesis for interaction ⋮ The Decidability of the Reachability Problem for CCS! ⋮ The λ-calculus in the π-calculus ⋮ The Value-Passing Calculus ⋮ FROM COMPUTING TO INTERACTION: ON THE EXPRESSIVENESS OF ASYNCHRONOUS PI-CALCULUS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On quasi-open bisimulation
• Linear logic
• On the expressiveness and decidability of higher-order process calculi
• \(\pi\)-calculus, internal mobility, and agent-passing calculi
• Symbolic bisimulations
• Bisimulation for higher-order process calculi
• Bisimulation and divergence
• Fair ambients
• Comparing communication primitives via their relative expressive power
• The lambda calculus, its syntax and semantics
• A calculus of mobile processes. I
• A theory of higher order communicating systems
• Testing equivalences for processes
• Mobile ambients
• On the computational strength of pure ambient calculi
• What is a ``good encoding of guarded choice?
• On the expressive power of movement and restriction in pure mobile ambients
• Tau laws for pi calculus
• A theory of bisimulation for the \(\pi\)-calculus
• Tutorial on separation results in process calculi via leader election problems
• Leader election in rings of ambient processes
• The theory of well-quasi-ordering: a frequently discovered concept
• On the Relative Expressive Power of Calculi for Mobility
• Linearity, Persistence and Testing Semantics in the Asynchronous Pi-Calculus
• The λ-calculus in the π-calculus
• Complexity Theory
• Towards a Unified Approach to Encodability and Separation Results for Process Calculi
• Process Algebra
• Functions as processes
• Branching time and abstraction in bisimulation semantics
• Barbed bisimulation
• Foundations of Software Science and Computation Structures
• Automata, Languages and Programming
• Welcome to the Jungle: A Subjective Guide to Mobile Process Calculi
• Well-structured transition systems everywhere!
• On bisimulations for the asynchronous π-calculus
• Decoding choice encodings

This page was built for publication: On the expressiveness of interaction