scientific article

From MaRDI portal
Publication:2760245

zbMath1035.68071MaRDI QIDQ2760245

Joachim Parrow

Publication date: 2001


Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.



Related Items

What is a free name in a process algebra?, Basic observables for a calculus for global computing, A Propositional Dynamic Logic for Concurrent Programs Based on the π-Calculus, Behavioural equivalences of a probabilistic pi-calculus, Theory of interaction, The reflective higher-order calculus: encodability, typability and separation, The synchronized ambient calculus, More on bisimulations for higher order \(\pi\)-calculus, Unnamed Item, Complexity analysis of new task allocation problem using network flow method on multicore clusters, Unnamed Item, Correct audit logging in concurrent systems, A Formal Environment Model for Multi-Agent Systems, A compositional Petri net translation of general \(\pi\)-calculus terms, A calculus of quality for robustness against unreliable communication, Open bisimulation, revisited, Free-algebra models for the \(\pi \)-calculus, Symmetric electoral systems for ambient calculi, A process calculus for mobile ad hoc networks, Asynchronous Logic Circuits and Sheaf Obstructions, On the expressive power of \textsc{Klaim}-based calculi, Abstract reduction in directed model checking CCS processes, Ensuring termination by typability, Analysing the MUTE Anonymous File-Sharing System Using the Pi-Calculus, Comparing communication primitives via their relative expressive power, Unnamed Item, An Epistemic Predicate CTL* for Finite Control π-Processes, PiStache: Implementing π-Calculus in Scala, Processes against tests: on defining contextual equivalences, On the expressiveness of π-calculus for encoding mobile ambients, Synchrony vs Asynchrony in Communication Primitives, A Completeness Proof for Bisimulation in the pi-calculus Using Isabelle