Finite-control mobile ambients

DOI10.1007/3-540-45927-8_21MaRDI QIDQ4738363zbMATH OpenFDO

Authors Witold Charatonik, Andrew D. Gordon, Jean-Marc Talbot

Publication date 11 August 2004

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• Model checking mobile ambients
• The decidability of model checking mobile ambients
• M^3: mobility types for mobile processes in mobile ambients
• The complexity of model checking mobile ambients
• When ambients cannot be opened

Cited in

(14)

• Probabilistic mobile ambients
• Mobile ambients
• When ambients cannot be opened
• On the expressive power of movement and restriction in pure mobile ambients
• Model checking mobile ambients
• Elimination of quantifiers and undecidability in spatial logics for concurrency
• The complexity of model checking mobile ambients
• Decidable Extensions of Hennessy-Milner Logic
• A model checking-based approach for security policy verification of mobile systems
• The decidability of model checking mobile ambients
• Decidable fragments of a higher order calculus with locations
• Stochastic ambient calculus
• Space-aware ambients and processes
• Typed context awareness ambient calculus for pervasive applications

This page was built for publication: Finite-control mobile ambients

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4738363)