Publication:4457838
From MaRDI portal
zbMath1062.68077MaRDI QIDQ4457838
Publication date: 17 March 2004
68Q85: Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.)
68M14: Distributed systems
Related Items
Proof-relevant π-calculus: a constructive account of concurrency and causality, Psi-calculi in Isabelle, Declarative event based models of concurrency and refinement in psi-calculi, Encoding cryptographic primitives in a calculus with polyadic synchronisation, A taxonomy of process calculi for distribution and mobility, Comparing communication primitives via their relative expressive power, On the validity of encodings of the synchronous in the asynchronous \(\pi\)-calculus, A formal approach to open multiparty interactions, Towards a unified approach to encodability and separation results for process calculi, The \(C_\pi\)-calculus: a model for confidential name passing, Expressiveness of concurrent intensionality, Replacement freeness: a criterion for separating process calculi, The \texttt{link}-calculus for open multiparty interactions, Stochastic biological modelling in the presence of multiple compartments, Tutorial on separation results in process calculi via leader election problems, Behavioural equivalences for dynamic web data, A CPS encoding of name-passing in higher-order mobile embedded resources, Modelling dynamic web data, On the Relative Expressive Power of Calculi for Mobility, A Sorted Semantic Framework for Applied Process Calculi (Extended Abstract), Encoding Catalytic P Systems in π@, Linearity, Persistence and Testing Semantics in the Asynchronous Pi-Calculus, Matching Systems for Concurrent Calculi, Coordination Models Orc and Reo Compared, Efficient Stochastic Simulation of Biological Systems with Multiple Variable Volumes, The Attributed Pi-Calculus with Priorities, Typed ψ-calculi, On the Expressiveness of Symmetric Communication, Towards a Unified Approach to Encodability and Separation Results for Process Calculi
