scientific article; zbMATH DE number 2059568
From MaRDI portal
Publication:4457838
zbMATH Open1062.68077MaRDI QIDQ4457838FDOQ4457838
Authors: Marco Carbone, Sergio Maffeis 
Publication date: 17 March 2004
Title of this publication is not available (Why is that?)
Recommendations
Distributed systems (68M14) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Cited In (40)
- Linearity, persistence and testing semantics in the asynchronous pi-calculus
- Title not available (Why is that?)
- A formal approach to open multiparty interactions
- Stochastic biological modelling in the presence of multiple compartments
- Efficient stochastic simulation of biological systems with multiple variable volumes
- On the relative expressive power of calculi for mobility
- Towards a Unified Approach to Encodability and Separation Results for Process Calculi
- The \(C_\pi\)-calculus: a model for confidential name passing
- Encoding cryptographic primitives in a calculus with polyadic synchronisation
- Declarative event based models of concurrency and refinement in psi-calculi
- On distributability in process calculi
- A generic type system for higher-order \(\Psi\)-calculi
- Coordination models Orc and Reo compared
- Comparing the expressiveness of the \(\pi \)-calculus and CCS
- Towards a unified approach to encodability and separation results for process calculi
- On the validity of encodings of the synchronous in the asynchronous \(\pi\)-calculus
- Proof-relevant \(\pi\)-calculus: a constructive account of concurrency and causality
- Behavioural equivalences for dynamic web data
- Tutorial on separation results in process calculi via leader election problems
- On the expressiveness of symmetric communication
- The attributed pi-calculus with priorities
- A generic type system for higher-order \(\Psi\)-calculi
- A sorted semantic framework for applied process calculi (extended abstract)
- The \texttt{link}-calculus for open multiparty interactions
- Title not available (Why is that?)
- Modelling dynamic web data
- Replacement freeness: a criterion for separating process calculi
- Expressiveness of concurrent intensionality
- On the expressive power of polyadic synchronisation in \(\pi \)-calculus
- Matching systems for concurrent calculi
- Encoding catalytic P systems in {\(\pi\)}\@
- Psi-calculi in Isabelle
- Encodability and separation for a reflective higher-order calculus
- Typed ψ-calculi
- A CPS encoding of name-passing in higher-order mobile embedded resources
- A taxonomy of process calculi for distribution and mobility
- Comparing the expressive power of the synchronous and asynchronous \(\pi\)-calculi
- The reflective higher-order calculus: encodability, typability and separation
- Matching in the pi-calculus
- Comparing communication primitives via their relative expressive power
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 Q4457838)
