The complexity of model checking mobile ambients

DOI10.1007/3-540-45315-6_10MaRDI QIDQ2769429zbMATH OpenFDO

Authors Witold Charatonik, Silvano Dal Zilio, Andrew D. Gordon, Jean-Marc Talbot, Supratik Mukhopadhyay

Publication date 5 February 2002

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/2030/20300152

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Analysis of algorithms and problem complexity (68Q25) Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• Model checking mobile ambients
• The decidability of model checking mobile ambients
• A fully abstract model for mobile ambients
• scientific article; zbMATH DE number 2087553
• When ambients cannot be opened

Cited in

(11)

• Model checking mobile ambients
• Nesting analysis of mobile ambients
• A semiring-based quantitative analysis of mobile systems
• Formal Modeling of Mobile Computing Systems Based on Ambient Abstract State Machines
• On Model Checking Boolean BI
• Deciding reachability problems in Turing-complete fragments of Mobile Ambients
• scientific article; zbMATH DE number 2038740 (Why is no real title available?)
• scientific article; zbMATH DE number 2087553 (Why is no real title available?)
• The decidability of model checking mobile ambients
• Deciding reachability in mobile ambients with name restriction
• Axiomatisation and decidability of multi-dimensional Duration Calculus

This page was built for publication: The complexity of model checking mobile ambients

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