Basic observables for a calculus for global computing

DOI10.1016/j.ic.2007.03.004zbMath1119.68124OpenAlexW2154774771WikidataQ57650814 ScholiaQ57650814MaRDI QIDQ2384924

Rosario Pugliese, Daniele Gorla, Rocco De Nicola

Publication date: 10 October 2007

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ic.2007.03.004

zbMATH Keywords

bisimulationProcess calculiMay testingbasic observablesdistribution and mobilityexplicit connections

Mathematics Subject Classification ID

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

Related Items

Network Conscious π-calculus: A Concurrent Semantics ⋮ A formal approach to open multiparty interactions ⋮ A theory of system behaviour in the presence of node and link failure ⋮ Counting the Cost in the Picalculus (Extended Abstract) ⋮ A network-conscious \(\pi\)-calculus and its coalgebraic semantics ⋮ Network-conscious \(\pi\)-calculus -- a model of Pastry

Uses Software

• Klava
• KLAIM
• Linda
• tKlaim

Cites Work

• Unnamed Item
• Bisimulation for higher-order process calculi
• A calculus of mobile processes. II
• An algebraic verification of a mobile network
• On bisimulations for the asynchronous \(\pi\)-calculus
• Basic observables for processes
• Testing equivalences for processes
• On reduction-based process semantics
• On modelling mobility
• Mobile ambients
• Trace and testing equivalence on asynchronous processes
• Towards a behavioural theory of access and mobility control in distributed systems
• Testing equivalence for mobile processes
• Pure bigraphs: structure and dynamics
• On the expressive power of \textsc{Klaim}-based calculi
• The seal calculus
• Communication and mobility control in boxed ambients
• The m-calculus
• Behavioral theory for mobile ambients
• Nomadic pict
• Generative communication in Linda
• Barbed bisimulation
• Foundations of Software Science and Computation Structures
• Automata, Languages and Programming
• CONCUR 2005 – Concurrency Theory
• FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science
• From rewrite rules to bisimulation congruences
• A calculus of mobile agents