Theory of interaction
From MaRDI portal
Publication:896903
DOI10.1016/j.tcs.2015.07.043zbMath1353.68082OpenAlexW2126724881MaRDI QIDQ896903
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
Related Items (12)
Model independent approach to probabilistic models ⋮ Parameterizing higher-order processes on names and processes ⋮ Unnamed Item ⋮ Replacement freeness: a criterion for separating process calculi ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Extensional Petri net ⋮ On the interactive power of higher-order processes extended with parameterization ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Counting nondeterministic computations ⋮ A thesis for interaction
Cites Work
- On quasi-open bisimulation
- Refusal testing
- \(\pi\)-calculus, internal mobility, and agent-passing calculi
- Symbolic bisimulations
- Bisimulation for higher-order process calculi
- Communicating processes with value-passing and assignments
- Bisimulation and divergence
- The lambda calculus. Its syntax and semantics. Rev. ed.
- Fair ambients
- On the expressiveness of interaction
- Comparing communication primitives via their relative expressive power
- 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
- A calculus of communicating systems
- A proof system for communicating processes with value-passing
- The chemical abstract machine
- A calculus of mobile processes. II
- Call-by-name, call-by-value and the \(\lambda\)-calculus
- A complete axiomatisation for observational congruence of finite-state behaviours
- On bisimulations for the asynchronous \(\pi\)-calculus
- Basic observables for processes
- A theory of communicating processes with value passing
- Plain CHOCS. A second generation calculus for higher order processes
- The lazy lambda calculus in a concurrency scenario
- A theory of higher order communicating systems
- Testing equivalences for processes
- On reduction-based process semantics
- Branching bisimilarity is an equivalence indeed!
- Nonaxiomatisability of equivalences over finite state processes
- Bisimulation congruence of \(\chi\)-calculus
- Complete inference systems for weak bisimulation equivalences in the \(\pi\)-calculus.
- Mobile ambients
- Asynchronous process calculi: The first- and higher-order paradigms
- Typing evolving ambients
- On the computational strength of pure ambient calculi
- Proof systems for message-passing process algebras
- Process rewrite systems.
- What is a ``good encoding of guarded choice?
- Decoding choice encodings
- On the expressive power of movement and restriction in pure mobile ambients
- Tau laws for pi calculus
- Objects in the \(\pi\)-calculus
- Algebraic theories for name-passing calculi
- Testing equivalence for mobile processes
- A theory of bisimulation for the \(\pi\)-calculus
- Distinguishing and relating higher-order and first-order processes by expressiveness
- Variations on mobile processes
- Tutorial on separation results in process calculi via leader election problems
- Symmetric electoral systems for ambient calculi
- Leader election in rings of ambient processes
- The theory of well-quasi-ordering: a frequently discovered concept
- Axiomatising divergence
- On the Relative Expressive Power of Calculi for Mobility
- The Value-Passing Calculus
- 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
- Complexity Theory
- Branching Bisimilarity with Explicit Divergence
- A Distributed Pi-Calculus
- Behavioral theory for mobile ambients
- Towards a Unified Approach to Encodability and Separation Results for Process Calculi
- Undecidability of bisimilarity by defender's forcing
- On the Expressiveness of Polyadic and Synchronous Communication in Higher-Order Process Calculi
- Algebraic laws for nondeterminism and concurrency
- Process Algebra
- Functions as processes
- Communicating sequential processes
- Termination, deadlock, and divergence
- Three logics for branching bisimulation
- Leader election in asynchronous distributed systems
- A proof theoretical approach to communication
- Divergence and fair testing
- On asynchrony in name-passing calculi
- From π-calculus to higher-order π-calculus — and back
- π-Calculus semantics of object-oriented programming languages
- Complete inference systems for weak bisimulation equivalences in the π-calculus
- Branching Bisimilarity Checking for PRS
- Controlling interference in ambients
- Barbed bisimulation
- What are the Fundamental Structures of Concurrency?
- Foundations of Software Science and Computation Structures
- Computational Complexity
- Checking Equality and Regularity for Normed BPA with Silent Moves
- Automata, Languages and Programming
- Equivalence-checking on infinite-state systems: Techniques and results
- Non-deterministic structures of computation
- Welcome to the Jungle: A Subjective Guide to Mobile Process Calculi
- Well-structured transition systems everywhere!
- Unique fixpoint induction for message-passing process calculi
- Divergence in testing and readiness semantics
- Symbolic transition graph with assignment
- On the expressiveness of internal mobility in name-passing calculi
- Decoding choice encodings
- A calculus of mobile agents
- 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
- 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
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Theory of interaction
