Theory of interaction

DOI10.1016/J.TCS.2015.07.043zbMATH Open1353.68082OpenAlexW2126724881MaRDI QIDQ896903FDOQ896903

Authors: Yuxi Fu 

Publication date: 15 December 2015

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

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

Recommendations

• Interactive Computation
• A theory of interactive computation
• Computing and interaction
• Interactive foundations of computing
• Notes on interaction and Turing-computability

zbMATH Keywords

computationinteractionbisimulationprocess calculus

Mathematics Subject Classification ID

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

Cites Work

• Divergence in testing and readiness semantics
• π-Calculus semantics of object-oriented programming languages
• Foundations of Software Science and Computation Structures
• Controlling interference in ambients
• Typing evolving ambients
• Welcome to the Jungle: A Subjective Guide to Mobile Process Calculi
• Distinguishing and relating higher-order and first-order processes by expressiveness
• Axiomatising divergence
• Separation of synchronous and asynchronous communication via testing
• Linearity, persistence and testing semantics in the asynchronous pi-calculus
• Decidability of Branching Bisimulation on Normed Commutative Context-Free Processes
• The λ-calculus in the π-calculus
• Towards a Unified Approach to Encodability and Separation Results for Process Calculi
• Undecidability of bisimilarity by defender's forcing
• A proof theoretical approach to communication
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Complete inference systems for weak bisimulation equivalences in the π-calculus
• Branching Bisimilarity Checking for PRS
• What are the Fundamental Structures of Concurrency?
• Checking Equality and Regularity for Normed BPA with Silent Moves
• On the expressiveness of internal mobility in name-passing calculi
• Complexity Theory
• Title not available (Why is that?)
• Title not available (Why is that?)
• Computational Complexity
• Call-by-name, call-by-value and the \(\lambda\)-calculus
• The linear time -- branching time spectrum. I: The semantics of concrete, sequential processes.
• Structural operational semantics.
• Algebraic laws for nondeterminism and concurrency
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Functions as processes
• Title not available (Why is that?)
• Title not available (Why is that?)
• Bisimulation for higher-order process calculi
• The lambda calculus. Its syntax and semantics. Rev. ed.
• The chemical abstract machine
• A calculus of mobile processes. II
• A Distributed Pi-Calculus
• Title not available (Why is that?)
• A calculus of communicating systems
• Testing equivalences for processes
• Verification on infinite structures.
• Communicating sequential processes
• Title not available (Why is that?)
• Termination, deadlock, and divergence
• Bisimulation and divergence
• Well-structured transition systems everywhere!
• Process Algebra
• Title not available (Why is that?)
• The \(\pi\)-calculus: A theory of mobile processes
• A calculus of mobile agents
• The theory of well-quasi-ordering: a frequently discovered concept
• On reduction-based process semantics
• On asynchrony in name-passing calculi
• Barbed bisimulation
• \(\pi\)-calculus, internal mobility, and agent-passing calculi
• A complete inference system for a class of regular behaviours
• On the existence of symmetric algorithms to find leaders in networks of communicating sequential processes
• An introduction to the \(\pi\)-calculus.
• Three logics for branching bisimulation
• Mobile ambients
• Title not available (Why is that?)
• A complete axiomatisation for observational congruence of finite-state behaviours
• Tutorial on separation results in process calculi via leader election problems
• Title not available (Why is that?)
• Branching Bisimilarity with Explicit Divergence
• On the expressiveness of interaction
• A theory of higher order communicating systems
• Branching bisimilarity is an equivalence indeed!
• On the computational strength of pure ambient calculi
• Process rewrite systems.
• Title not available (Why is that?)
• Automata, Languages and Programming
• A proof system for communicating processes with value-passing
• A symbolic approach to value-passing processes
• Symbolic bisimulations
• Proof systems for message-passing process algebras
• A theory of bisimulation for the \(\pi\)-calculus
• Symbolic transition graph with assignment
• From π-calculus to higher-order π-calculus — and back
• Basic observables for processes
• A theory of communicating processes with value passing
• Divergence and fair testing
• Unique fixpoint induction for message-passing process calculi
• Communicating processes with value-passing and assignments
• Decoding choice encodings
• On bisimulations for the asynchronous \(\pi\)-calculus
• Title not available (Why is that?)
• What is a ``good encoding of guarded choice?
• Decoding choice encodings
• Testing equivalence for mobile processes
• Tau laws for pi calculus
• Algebraic theories for name-passing calculi
• Title not available (Why is that?)
• Title not available (Why is that?)
• On quasi-open bisimulation
• Refusal testing
• Nonaxiomatisability of equivalences over finite state processes
• Complete inference systems for weak bisimulation equivalences in the \(\pi\)-calculus.
• Bisimulation congruence of \(\chi\)-calculus
• Variations on mobile processes
• Behavioral theory for mobile ambients
• Fair ambients
• Plain CHOCS. A second generation calculus for higher order processes
• The lazy lambda calculus in a concurrency scenario
• On the expressive power of movement and restriction in pure mobile ambients
• Symmetric electoral systems for ambient calculi
• On the relative expressive power of calculi for mobility
• On the expressiveness of polyadic and synchronous communication in higher-order process calculi
• Title not available (Why is that?)
• Equivalence-checking on infinite-state systems: Techniques and results
• Comparing communication primitives via their relative expressive power
• Leader election in rings of ambient processes
• The Value-Passing Calculus
• Title not available (Why is that?)
• Leader election in asynchronous distributed systems
• Non-deterministic structures of computation
• Asynchronous process calculi: The first- and higher-order paradigms
• Objects in the \(\pi\)-calculus

Cited In (20)

• Branching bisimulation semantics for quantum processes
• Model independent approach to probabilistic models
• Title not available (Why is that?)
• Interactive Computation
• Parameterizing higher-order processes on names and processes
• Title not available (Why is that?)
• Behaviour, Interaction and Dynamics
• Extensional Petri net
• Title not available (Why is that?)
• On the interactive power of higher-order processes extended with parameterization
• Title not available (Why is that?)
• COMPARISON BETWEEN INTERACTION CONCEPTS
• Title not available (Why is that?)
• Replacement freeness: a criterion for separating process calculi
• A thesis for interaction
• Counting nondeterministic computations
• Title not available (Why is that?)
• Interaction between civilizations
• Title not available (Why is that?)
• Mixed choice in session types

This page was built for publication: Theory of interaction

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q896903)