Behavioral theory for mobile ambients

Merro, Massimo; Nardelli, Francesco Zappa

doi:10.1145/1101821.1101825

Cited by 65 publications

(71 citation statements)

References 44 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…This desirable property cannot be expressed in [20], where links between nodes can be added and removed nondeterministically. However, a tree-structured topology would imply an higher-order bisimulation (for details see [26]); while in the current paper we look for a simple (first-order) bisimulation proof-technique which could be easily mechanised.…”

Section: Design Choicesmentioning

confidence: 99%

A Semantic Theory of the Internet of Things

Lanotte

Merro

2016

Lecture Notes in Computer Science

Self Cite

View full text Add to dashboard Cite

We propose a process calculus for modelling systems in the Internet of Things paradigm. Our systems interact both with the physical environment, via sensors and actuators, and with smart devices, via short-range and Internet channels. The calculus is equipped with a standard notion of bisimilarity which is a fully abstract characterisation of a well-known contextual equivalence. We use our semantic proof-methods to prove run-time properties as well as system equalities of non-trivial IoT systems.

show abstract

Section: Design Choicesmentioning

confidence: 99%

A Semantic Theory of the Internet of Things

Lanotte

Merro

2016

Lecture Notes in Computer Science

Self Cite

View full text Add to dashboard Cite

show abstract

“…A process P satisfies the weak barb n (denoted as P ⇓ n ) if there exists a process P such that P * M P and P ↓ n , where * M is the transitive and reflexive closure of M . Strong and weak barbs are exploited to define the standard equivalence for MAs: weak reduction barbed congruence, of which a labelled characterization is in [12]. Before presenting it, we introduce MAs contexts: they are MAs processes with a hole −, formally generated by the following grammar (for R ∈ P M ) …”

Section: Mobile Ambientsmentioning

confidence: 99%

“…Finally, in order to properly establish the adequacy of our theory, we check it against suitable case studies. So, we instantiate our proposal over MAs and HoCore, addressing their weak semantics: the former has a notably complex barbed bisimilarity, resilient until recently to a labelled characterization [12]; and only the strong semantics was so far considered for the latter. Their complementary features allow for testing the expressiveness of our framework.…”

Section: Introductionmentioning

confidence: 99%

Towards a General Theory of Barbs, Contexts and Labels

Bonchi¹,

Gadducci²,

Monreale³

2011

Programming Languages and Systems

View full text Add to dashboard Cite

Abstract. Barbed bisimilarity is a widely-used behavioural equivalence for interactive systems: given a set of predicates (denoted "barbs", and representing basic observations on states) and a set of contexts (representing the possible execution environments), two systems are deemed to be equivalent if they verify the same barbs whenever inserted inside any of the chosen contexts. Despite its flexibility, this definition of equivalence is unsatisfactory, since often the quantification is over an infinite set of contexts, thus making barbed bisimilarity very hard to be verified.Should a labelled operational semantics be available for our system, more efficient observational equivalences might be adopted. To this end, a series of techniques have been proposed to derive labelled transition systems (LTSs) from unlabelled ones, the main example being Leifer and Milner's reactive systems. The underlying intuition is that labels are the "minimal" contexts that allow for a reduction to be performed.We introduce a framework that characterizes (weak) barbed bisimilarity via transition systems whose labels are (possibly minimal) contexts. Differently from other proposals, our theory is not dependent on the way LTSs are built, and it relies on a simple set-theoretical presentation. To provide a test-bed for our formalism, we instantiate it by addressing the semantics of mobile ambients and HoCore, recasting the (weak) barbed bisimilarities of these calculi via label-based behavioural equivalences.

show abstract

“…Unlike previous calculi, mobility in Mobile Ambients is subjective: localities move by themselves, without any acknowledgment from their environment. In [9], Merro and Zappa Nardelli define a context bisimilarity which characterizes barbed congruence in the weak case. A normal bisimulation without universal quantification has yet to be found.…”

Section: Related Workmentioning

confidence: 99%

Normal Bisimulations in Calculi with Passivation

Lenglet

Schmitt

Stefani

2009

Foundations of Software Science and Computational Structures

View full text Add to dashboard Cite

Abstract. Behavioral theory for higher-order process calculi is less well developed than for first-order ones such as the π-calculus. In particular, effective coinductive characterizations of barbed congruence, such as the notion of normal bisimulation developed by Sangiorgi for the higherorder π-calculus, are difficult to obtain. In this paper, we study bisimulations in two simple higher-order calculi with a passivation operator, that allows the interruption and thunkification of a running process. We develop a normal bisimulation that characterizes barbed congruence, in the strong and weak cases, for the first calculus which has no name restriction operator. We then show that this result does not hold in the calculus extended with name restriction.

show abstract

Behavioral theory for mobile ambients

Cited by 65 publications

References 44 publications

A Semantic Theory of the Internet of Things

A Semantic Theory of the Internet of Things

Towards a General Theory of Barbs, Contexts and Labels

Normal Bisimulations in Calculi with Passivation

Contact Info

Product

Resources

About