Filters








215 Hits in 2.7 sec

A bisimulation-based semantic theory of Safe Ambients

Massimo Merro, Matthew Hennessy
2006 ACM Transactions on Programming Languages and Systems  
We develop a semantics theory for SAP, a variant of Levi and Sangiorgi's Safe Ambients, SA.  ...  Then, we give an lts-based operational semantics for SAP and a labelled bisimulation equivalence which is proved to coincide with reduction barbed congruence.  ...  However we believe that the development of semantic theories for Ambients has had more limited success. This paper aims to provide a semantics theory for a significant variant of MA.  ... 
doi:10.1145/1119479.1119482 fatcat:ctbvmu33mrbmtpf7677pklwley

Barbs and Congruences for Safe Mobile Ambients

M.G. Vigliotti, I.C.C. Phillips
2002 Electronical Notes in Theoretical Computer Science  
In the context of Levi and Sangiorgi's Safe Mobile Ambients (SA), the extra co-capabilities required for interaction complicate the fundamental observations.  ...  The Ambient Calculus offers many ways in which processes can interact and be observed.  ...  Fournet and A. Gordon for useful discussions. We are also grateful to the anonymous referees for their useful comments and suggestions.  ... 
doi:10.1016/s1571-0661(04)80415-8 fatcat:cvhhhs35anfyzd65w2btxjq4ai

Bisimulation congruences in safe ambients

Massimo Merro, Matthew Hennessy
2002 Proceedings of the 29th ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '02  
~V~ give an lts based operational semantics for SAP and a labelled bisimulation based equivalence which is proved to coincide with barbed congruence.  ...  V~ study a variant of Levi and Sangiorgi's Sa% Ambients (SA) enriched with passwords (SAP).  ...  ACKNOWLEDGMENTS The authors would like to thank Julian Rathke and Davide Sangiorgi for insightful discussions on higher-order process calculi and Saf~ Ambients, respectively.  ... 
doi:10.1145/503272.503280 dblp:conf/popl/MerroH02 fatcat:upy4w4jzlfgqzfaxgaildqiwsq

On Reduction Semantics for the Push and Pull Ambient Calculus [chapter]

Iain Phillips, Maria Grazia Vigliotti
2002 Foundations of Information Technology in the Era of Network and Mobile Computing  
We apply their approach to a dialect of Cardelli and Gordon's Mobile Ambients.  ...  The version we propose here is the Push and Pull Ambient Calculus, where the operational semantics is no longer defined in terms of ambients entering and exiting other ambients, but in terms of being pulled  ...  Some techniques for proving contextual equivalence have been developed [7] , but in terms of bisimulation, the only successful definition has been developed for a dialect of MA, safe ambients with passwords  ... 
doi:10.1007/978-0-387-35608-2_45 dblp:conf/ifipTCS/PhillipsV02 fatcat:d3qmdvvgongjjemscjbkrbwuce

Intensionality of Modal Logic for Robust Ambient Calculus

Taolue Chen, Tingting Han, Jian Lu
2003 Electronical Notes in Theoretical Computer Science  
The calculus of Mobile Ambient is a widely studied formal mechanism for describing both mobile computing and mobile computation.  ...  Computation with mobility becomes a novel distributed computation paradigm with the development of network technology.  ...  Besides that, due to the similarity of ROAM and SA, our results can be easily adapted to the setting of safe ambient calculus (SA [12] ).  ... 
doi:10.1016/s1571-0661(05)80085-4 fatcat:hiii2u4y3zgbdlkzssaombo5dq

A Calculus of Mobile Resources* [chapter]

Jens Chr. Godskesen, Thomas Hildebrandt, Vladimiro Sassone
2002 Lecture Notes in Computer Science  
We provide a reduction as well as a labelled transition semantics and prove a correspondence between barbed bisimulation congruence and a higher-order bisimulation.  ...  We provide examples of the expressiveness of the calculus, and apply the theory to prove one of its characteristic properties.  ...  We have studied a semantic theory for MR based on a reduction semantics and a labelled transition systems, culminating in a bisimulation congruence that coincides with the barbed bisimulation.  ... 
doi:10.1007/3-540-45694-5_19 fatcat:g4xldnn4fnhvzglxjxa3mbp4au

Fair ambients

Yuxi Fu
2007 Acta Informatica  
The bisimulation theory of the fair ambients is studied and two coincidence results are established.  ...  Based on an analysis of the capability operators of the Calculus of Mobile Ambients, three fairness principles are proposed to safeguard the interactions of the ambients.  ...  Based on the analysis of the capability operators, we propose an operational semantics for the ambients that is defined purely in terms of a labeled transition system.  ... 
doi:10.1007/s00236-007-0038-z fatcat:vsgffji3zvf73gn57wj37jyuai

Stochastic Ambient Calculus

Maria G. Vigliotti, Peter G. Harrison
2006 Electronical Notes in Theoretical Computer Science  
We also define a strong Markov bisimulation in the style of reduction semantics known as barbed bisimulation.  ...  Inspired by previous models, PEPA and Sπ, we enhance the prefix of the capabilities with a rate and the ambient with a linear function that operates on the rates of processes executing inside it.  ...  Acknowledgements We would like to thank Gethin Norman for pointing out that recursion must be used instead of replication in SMA.  ... 
doi:10.1016/j.entcs.2006.07.018 fatcat:ttrfyefn5nhwrmtmdrhoj2jjvi

Bisimulation Proof Methods for Mobile Ambients [chapter]

Massimo Merro, Francesco Zappa Nardelli
2003 Lecture Notes in Computer Science  
We give an LTS based operational semantics, and a labelled bisimulation based equivalence that coincides with reduction barbed congruence.  ...  We study the behavioural theory of Cardelli and Gordon's Mobile Ambients.  ...  Acknowledgements The authors would like to thank Vladimiro Sassone who spotted a problem in an early draft of the paper. The anonymous referees contributed useful comments.  ... 
doi:10.1007/3-540-45061-0_47 fatcat:ecsldwba6bcevb6farqhlfsr5a

Twenty Years on: Reflections on the CEDISYS Project. Combining True Concurrency with Process Algebra [chapter]

Gérard Boudol, Ilaria Castellani, Matthew Hennessy, Mogens Nielsen, Glynn Winskel
2008 Lecture Notes in Computer Science  
The project was initiated and effectively animated by Ugo Montanari, a passionate and long-time advocate of both these approaches to the semantics of concurrency.  ...  We recall some memories of the Esprit Basic Research Action CEDISYS, a small, well-focussed and fruitful project which brought together researchers at the meeting point of true concurrency and process  ...  a stronger semantics to be defined, based on the conjunction of local and global causes.  ... 
doi:10.1007/978-3-540-68679-8_47 fatcat:4f2okdimfnfbfk2j6mdrq5lk3m

Resource-Aware Virtually Timed Ambients [chapter]

Einar Broch Johnsen, Martin Steffen, Johanna Beate Stumpf, Lars Tveito
2018 Lecture Notes in Computer Science  
Technically we extend virtually timed ambients with context-expressions using modal logic operators, give a formal semantics for the extension, and define bisimulation for resource-aware virtually timed  ...  Virtually timed ambients is a calculus of nested virtualization, which models timing and resource consumption for hierarchically structured virtual machines.  ...  A bisimulation relation for a fragment of mobile ambients, called mobile safe ambients, is defined in [13] and provides the basis for later work.  ... 
doi:10.1007/978-3-319-98938-9_12 fatcat:xmc5nch3wfgvjdgfhlu3gfr7ga

The Kell Calculus: A Family of Higher-Order Distributed Process Calculi [chapter]

Alan Schmitt, Jean-Bernard Stefani
2005 Lecture Notes in Computer Science  
The paper provides a co-inductive characterization of contextual equivalence for Kell calculi, under sufficient conditions on pattern languages, by means of a form of higher-order bisimulation called strong  ...  This paper presents the Kell calculus, a family of distributed process calculi, parameterized by languages for input patterns, that is intended as a basis for studying component-based distributed programming  ...  The contribution of all these individuals is greatly appreciated. The research reported in this paper has been supported in part by the IST Mikado project (IST-2001-32222).  ... 
doi:10.1007/978-3-540-31794-4_9 fatcat:bbeuy3dikrbghnybn4kpaeeut4

Probabilistic Model Checking of Labelled Markov Processes via Finite Approximate Bisimulations [chapter]

Alessandro Abate, Marta Kwiatkowska, Gethin Norman, David Parker
2014 Lecture Notes in Computer Science  
Motivated by the practical application of the LMP framework, we study its formal semantics and the relationship to similar models formulated in control theory.  ...  We consider notions of (exact and approximate) probabilistic bisimulation over LMPs and, drawing on methods from both formal verification and control theory, propose a simple technique to compute an approximate  ...  Exact bisimulation is in general considered a very conservative requirement, and approximate notions have been consequently developed [15, 19] , which are based on relaxing the notion of process equivalence  ... 
doi:10.1007/978-3-319-06880-0_2 fatcat:4q4rqu3rszdi3ae7s2fk2vyua4

Measurable Stochastics for Brane Calculus

Giorgio Bacci, Marino Miculan
2010 Electronic Proceedings in Theoretical Computer Science  
In this presentation, the semantics of a Brane process is a measure of the stochastic distribution of possible derivations.  ...  Finally, we provide a SOS presentation of this stochastic semantics, which is compositional and syntax-driven.  ...  Acknoledgements We would like to thank Radu Mardare for providing us an updated preliminary copy of [8] and for the valuable discussions about the definition of Markov Processes.  ... 
doi:10.4204/eptcs.40.2 fatcat:kr6iphorzvahfafpx4dgyvp43e

Reducing Higher Order Pi-Calculus to Spatial Logics [article]

Zining Cao
2012 arXiv   pre-print
We also extend bisimulations for processes to that for SL formulae. Then we extend all definitions and results of SL to a weak semantics version of SL, called WL. At last, we add mu-operator to SL.  ...  In this paper, we show that theory of processes can be reduced to the theory of spatial logic. Firstly, we propose a spatial logic SL for higher order pi-calculus, and give an inference system of SL.  ...  the theory of processes to the theory of spatial logic in the case of weak semantics.  ... 
arXiv:1011.2896v2 fatcat:toe7v4qywfhgre4xad4r3mle7q
« Previous Showing results 1 — 15 out of 215 results