scientific article; zbMATH DE number 1512615

MaRDI QIDQ4508299zbMATH OpenFDO

Authors Oltea Mihaela Herescu, Catuscia Palamidessi

Publication date 3 October 2000

zbMATH Keywords

asynchronous \(\pi\)-calculus

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• A Probabilistic Applied Pi–Calculus
• A randomized encoding of the \(\pi\)-calculus with mixed choice
• Probabilistic -calculus and event structures
• Behavioural equivalences of a probabilistic pi-calculus
• On the Asynchronous Nature of the Asynchronous π-Calculus

Cited in

(34)

• Probabilistic mobile ambients
• Abstractions for fault-tolerant global computing
• Characterisations of testing preorders for a finite probabilistic \(\pi\)-calculus
• A general overview of formal languages for individual-based modelling of ecosystems
• A framework for analyzing probabilistic protocols and its application to the partial secrets exchange
• \(\pi\)-calculus with noisy channels
• Quantitative information in the tuple space coordination model
• \textsf{MarCaSPiS}: a Markovian extension of a calculus for services
• Stochastic Pi-calculus Revisited
• Probabilistic configuration theories
• Probabilistic -calculus and event structures
• scientific article; zbMATH DE number 6712184 (Why is no real title available?)
• A Probabilistic Applied Pi–Calculus
• Linear-algebraic λ-calculus: higher-order, encodings, and confluence.
• Analysing the MUTE Anonymous File-Sharing System Using the Pi-Calculus
• Concurrency, σ-Algebras, and Probabilistic Fairness
• Behavioural equivalences of a probabilistic pi-calculus
• Probabilistic Analysis of Binary Sessions
• Randomized dining philosophers without fairness assumption
• The vectorial \(\lambda\)-calculus
• Compositional Methods for Information-Hiding
• Non-determinism and Probabilities in Timed Concurrent Constraint Programming
• A randomized encoding of the \(\pi\)-calculus with mixed choice
• Causal Unfoldings
• Uniform random process model revisited
• Logical characterization of branching bisimilarity over random processes
• Trace machines for observing continuous-time Markov chains
• Metrics for action-labelled quantitative transition systems
• Expressiveness of probabilistic -calculus
• Probabilistic and nondeterministic aspects of anonymity
• Probable innocence revisited
• Axiomatizations for probabilistic finite-state behaviors
• Typed event structures and the linear \(\pi \)-calculus
• Probabilistic anonymity via coalgebraic simulations

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 Q4508299)