scientific article; zbMATH DE number 2038705
From MaRDI portal
Publication:4449170
Recommendations
- On Recursion, Replication and Scope Mechanisms in Process Calculi
- SOFSEM 2005: Theory and Practice of Computer Science
- Automata, Languages and Programming
- On the expressive power of recursion, replication and iteration in process calculi
- Parallel repetition of computationally sound protocols revisited
- Parallel Repetition of Computationally Sound Protocols Revisited
- scientific article; zbMATH DE number 1863156
- Bounded implementations of replicated data types
- Relative expressiveness of calculi for reversible concurrency
- Explicit Identifiers and Contexts in Reversible Concurrent Calculus
Cited in
(17)- On the computational strength of pure ambient calculi
- Distinguishing and relating higher-order and first-order processes by expressiveness
- Towards a unified approach to encodability and separation results for process calculi
- The Decidability of the Reachability Problem for CCS!
- On the Relationship between π-Calculus and Finite Place/Transition Petri Nets
- CCS with Replication in the Chomsky Hierarchy: The Expressive Power of Divergence
- On Recursion, Replication and Scope Mechanisms in Process Calculi
- On the Expressive Power of Restriction and Priorities in CCS with Replication
- On the expressive power of recursion, replication and iteration in process calculi
- Foundations of Software Science and Computation Structures
- Automata, Languages and Programming
- Replications in reversible concurrent calculi
- On the expressiveness and decidability of higher-order process calculi
- Decidability issues for extended ping-pong protocols
- Theory of interaction
- On the expressiveness of interaction
- Typed event structures and the linear \(\pi \)-calculus
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4449170)
