Theory of interaction
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3885321 (Why is no real title available?)
- scientific article; zbMATH DE number 4011914 (Why is no real title available?)
- scientific article; zbMATH DE number 4039251 (Why is no real title available?)
- scientific article; zbMATH DE number 3664335 (Why is no real title available?)
- scientific article; zbMATH DE number 3714941 (Why is no real title available?)
- scientific article; zbMATH DE number 3716792 (Why is no real title available?)
- scientific article; zbMATH DE number 3744561 (Why is no real title available?)
- scientific article; zbMATH DE number 42752 (Why is no real title available?)
- scientific article; zbMATH DE number 48630 (Why is no real title available?)
- scientific article; zbMATH DE number 194103 (Why is no real title available?)
- scientific article; zbMATH DE number 1223723 (Why is no real title available?)
- scientific article; zbMATH DE number 1229489 (Why is no real title available?)
- scientific article; zbMATH DE number 610968 (Why is no real title available?)
- scientific article; zbMATH DE number 1142308 (Why is no real title available?)
- scientific article; zbMATH DE number 2038705 (Why is no real title available?)
- scientific article; zbMATH DE number 2155191 (Why is no real title available?)
- scientific article; zbMATH DE number 2086654 (Why is no real title available?)
- scientific article; zbMATH DE number 1860680 (Why is no real title available?)
- scientific article; zbMATH DE number 1863170 (Why is no real title available?)
- scientific article; zbMATH DE number 1405656 (Why is no real title available?)
- scientific article; zbMATH DE number 3291134 (Why is no real title available?)
- A Distributed Pi-Calculus
- A calculus of communicating systems
- A calculus of mobile agents
- A calculus of mobile processes. II
- A complete axiomatisation for observational congruence of finite-state behaviours
- A complete inference system for a class of regular behaviours
- A proof system for communicating processes with value-passing
- A proof theoretical approach to communication
- A symbolic approach to value-passing processes
- A theory of bisimulation for the -calculus
- A theory of communicating processes with value passing
- A theory of higher order communicating systems
- Algebraic laws for nondeterminism and concurrency
- Algebraic theories for name-passing calculi
- An introduction to the \(\pi\)-calculus.
- Asynchronous process calculi: The first- and higher-order paradigms
- Automata, Languages and Programming
- Axiomatising divergence
- Barbed bisimulation
- Basic observables for processes
- Behavioral theory for mobile ambients
- Bisimulation and divergence
- Bisimulation congruence of -calculus
- Bisimulation for higher-order process calculi
- Branching Bisimilarity with Explicit Divergence
- Branching bisimilarity checking for PRS
- Branching bisimilarity is an equivalence indeed!
- Call-by-name, call-by-value and the \(\lambda\)-calculus
- Checking equality and regularity for normed BPA with silent moves
- Communicating processes with value-passing and assignments
- Communicating sequential processes
- Comparing communication primitives via their relative expressive power
- Complete inference systems for weak bisimulation equivalences in the \(\pi\)-calculus
- Complete inference systems for weak bisimulation equivalences in the -calculus.
- Complexity Theory
- Computational Complexity
- Controlling interference in ambients
- Decidability of branching bisimulation on normed commutative context-free processes
- Decoding choice encodings
- Decoding choice encodings
- Distinguishing and relating higher-order and first-order processes by expressiveness
- Divergence and fair testing
- Divergence in testing and readiness semantics
- Equivalence-checking on infinite-state systems: Techniques and results
- Fair ambients
- Foundations of Software Science and Computation Structures
- From \(\pi \)-calculus to higher-order \(\pi \)-calculus -- and back
- Functions as processes
- Leader election in asynchronous distributed systems
- Leader election in rings of ambient processes
- Linearity, persistence and testing semantics in the asynchronous pi-calculus
- Mobile ambients
- Musings on encodings and expressiveness
- Non-deterministic structures of computation
- Nonaxiomatisability of equivalences over finite state processes
- Objects in the \(\pi\)-calculus
- On asynchrony in name-passing calculi
- On bisimulations for the asynchronous -calculus
- On quasi-open bisimulation
- On reduction-based process semantics
- On the computational strength of pure ambient calculi
- On the existence of symmetric algorithms to find leaders in networks of communicating sequential processes
- On the expressive power of movement and restriction in pure mobile ambients
- On the expressiveness of interaction
- On the expressiveness of internal mobility in name-passing calculi
- On the expressiveness of polyadic and synchronous communication in higher-order process calculi
- On the relative expressive power of calculi for mobility
- Plain CHOCS. A second generation calculus for higher order processes
- Process Algebra
- Process rewrite systems.
- Proof systems for message-passing process algebras
- Refusal testing
- Separation of synchronous and asynchronous communication via testing
- Structural operational semantics.
- Symbolic bisimulations
- Symbolic transition graph with assignment
- Symmetric electoral systems for ambient calculi
- Tau laws for pi calculus
- Termination, deadlock, and divergence
- Testing equivalence for mobile processes
- Testing equivalences for processes
- The Value-Passing Calculus
- The \(\lambda \)-calculus in the \(\pi \)-calculus
- The \(\pi\)-calculus: A theory of mobile processes
- The chemical abstract machine
- The lambda calculus. Its syntax and semantics. Rev. ed.
- The lazy lambda calculus in a concurrency scenario
- The linear time -- branching time spectrum. I: The semantics of concrete, sequential processes.
- The theory of well-quasi-ordering: a frequently discovered concept
- Three logics for branching bisimulation
- Towards a Unified Approach to Encodability and Separation Results for Process Calculi
- Tutorial on separation results in process calculi via leader election problems
- Typing evolving ambients
- Undecidability of bisimilarity by defender's forcing
- Unique fixpoint induction for message-passing process calculi
- Variations on mobile processes
- Verification on infinite structures.
- Welcome to the Jungle: A Subjective Guide to Mobile Process Calculi
- Well-structured transition systems everywhere!
- What are the fundamental structures of concurrency? We still don't know!
- What is a ``good encoding of guarded choice?
- \(\pi\)-calculus semantics of object-oriented programming languages
- \(\pi\)-calculus, internal mobility, and agent-passing calculi
Cited in
(21)- Branching bisimulation semantics for quantum processes
- Model independent approach to probabilistic models
- scientific article; zbMATH DE number 7449992 (Why is no real title available?)
- Interactive Computation
- Extensional Petri net
- Parameterizing higher-order processes on names and processes
- scientific article; zbMATH DE number 7243676 (Why is no real title available?)
- Behaviour, Interaction and Dynamics
- Computing and interaction
- On the interactive power of higher-order processes extended with parameterization
- scientific article; zbMATH DE number 2084605 (Why is no real title available?)
- COMPARISON BETWEEN INTERACTION CONCEPTS
- Replacement freeness: a criterion for separating process calculi
- A thesis for interaction
- Counting nondeterministic computations
- scientific article; zbMATH DE number 1755135 (Why is no real title available?)
- On the expressiveness of mixed choice sessions
- Interaction between civilizations
- scientific article; zbMATH DE number 7204939 (Why is no real title available?)
- Higher-order processes with parameterization over names and processes
- 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)
