scientific article; zbMATH DE number 2038740

MaRDI QIDQ4449205zbMATH OpenFDO

Authors Massimo Merro, Francesco Zappa Nardelli

Publication date 8 February 2004

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2719/27190584.htm

Mathematics Subject Classification ID

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

Recommendations

• On the proof method for bisimulation
• scientific article; zbMATH DE number 1361141
• On the bisimulation proof method
• scientific article; zbMATH DE number 1841829
• Enhancements of the bisimulation proof method
• scientific article; zbMATH DE number 4022620
• Bisimulation congruences in safe ambients
• scientific article; zbMATH DE number 2219130
• scientific article; zbMATH DE number 1701350

Cited in

(17)

• Towards a behavioural theory of access and mobility control in distributed systems
• Pure bigraphs: structure and dynamics
• Name-passing in an ambient-like calculus and its proof using spatial logic
• The seal calculus
• Communication and mobility control in boxed ambients
• On an open problem of Amadio and Curien: The finite antichain condition
• safeDpi: a language for controlling mobile code
• Coalgebraic symbolic semantics
• On Bisimulation Proofs for the Analysis of Distributed Abstract Machines
• Reactive Systems, Barbed Semantics, and the Mobile Ambients
• scientific article; zbMATH DE number 2163045 (Why is no real title available?)
• Equational properties of mobile ambients
• Bisimulation congruences in safe ambients
• Formal Techniques for Networked and Distributed Systems - FORTE 2005
• scientific article; zbMATH DE number 2219130 (Why is no real title available?)
• Fair ambients
• Using bisimulation proof techniques for the analysis of distributed abstract machines

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