On the expressiveness of interaction
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 5595151 (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 3735143 (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 2038705 (Why is no real title available?)
- scientific article; zbMATH DE number 194916 (Why is no real title available?)
- scientific article; zbMATH DE number 1863170 (Why is no real title available?)
- A calculus of mobile processes. I
- A symbolic approach to value-passing processes
- A theory of bisimulation for the \(\pi\)-calculus
- A theory of higher order communicating systems
- Algorithms. Design techniques and analysis
- Automata, Languages and Programming
- Barbed bisimulation
- Bisimulation and divergence
- Bisimulation for higher-order process calculi
- Branching time and abstraction in bisimulation semantics
- Comparing communication primitives via their relative expressive power
- Complexity Theory
- Decoding choice encodings
- Fair ambients
- Foundations of Software Science and Computation Structures
- Functions as processes
- Leader election in rings of ambient processes
- Linear logic
- Linearity, persistence and testing semantics in the asynchronous pi-calculus
- Mobile ambients
- On bisimulations for the asynchronous π-calculus
- On quasi-open bisimulation
- On the computational strength of pure ambient calculi
- On the expressive power of movement and restriction in pure mobile ambients
- On the expressiveness and decidability of higher-order process calculi
- On the relative expressive power of calculi for mobility
- Process Algebra
- Symbolic bisimulations
- Tau laws for pi calculus
- Testing equivalences for processes
- The \(\lambda \)-calculus in the \(\pi \)-calculus
- The \(\pi\)-calculus: A theory of mobile processes
- The lambda calculus, its syntax and semantics
- The theory of well-quasi-ordering: a frequently discovered concept
- Towards a Unified Approach to Encodability and Separation Results for Process Calculi
- Tutorial on separation results in process calculi via leader election problems
- Welcome to the Jungle: A Subjective Guide to Mobile Process Calculi
- Well-structured transition systems everywhere!
- What is a ``good encoding of guarded choice?
- \(\pi\)-calculus, internal mobility, and agent-passing calculi
Cited in
(40)- Full abstraction for expressiveness: history, myths and facts
- Comparing the expressiveness of the \(\pi \)-calculus and CCS
- Parameterizing higher-order processes on names and processes
- Reactive Turing machines
- Theory of interaction
- scientific article; zbMATH DE number 7204939 (Why is no real title available?)
- Translation of CCS into CSP, correct up to strong bisimulation
- On Recursion, Replication and Scope Mechanisms in Process Calculi
- From CCS to CSP: the \(m\)-among-\(n\) synchronisation approach
- On the expressiveness of mixed choice sessions
- On the expressive power of CCS
- On the relative expressiveness of higher-order session processes
- The \(\lambda \)-calculus in the \(\pi \)-calculus
- From computing to interaction: on the expressiveness of asynchronous pi-calculus
- Mixed choice in session types
- Non-deterministic structures of computation
- Distinguishing and relating higher-order and first-order processes by expressiveness
- A thesis for interaction
- Counting nondeterministic computations
- On the interactive power of higher-order processes extended with parameterization
- Expressiveness via intensionality and concurrency
- Coupled similarity: the first 32 years
- Modeling and analysis of real-time systems with mutex components
- The \(\pi\)-calculus is behaviourally complete and orbit-finitely executable
- scientific article; zbMATH DE number 1531818 (Why is no real title available?)
- The expressive power of implicit specifications
- Expressiveness of concurrent intensionality
- scientific article; zbMATH DE number 7449992 (Why is no real title available?)
- Directives, expressives, and motivation
- Replacement freeness: a criterion for separating process calculi
- scientific article; zbMATH DE number 2152256 (Why is no real title available?)
- FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science
- The Decidability of the Reachability Problem for CCS!
- Higher-order processes with parameterization over names and processes
- The Value-Passing Calculus
- Breaking symmetries
- COMPARISON BETWEEN INTERACTION CONCEPTS
- On the relative expressiveness of higher-order session processes
- Foundations of Software Science and Computation Structures
- Extensional Petri net
This page was built for publication: On the expressiveness of interaction
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q960859)