The decidability of model checking mobile ambients

DOI10.1007/3-540-44802-0_24MaRDI QIDQ4783317zbMATH OpenFDO

Authors Witold Charatonik, Jean-Marc Talbot

Publication date 4 December 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/2142/21420339

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45) Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• Model checking mobile ambients
• The complexity of model checking mobile ambients
• scientific article; zbMATH DE number 2087553
• Programming Languages and Systems
• Deciding reachability problems in Turing-complete fragments of Mobile Ambients

Cited in

(27)

• Probabilistic mobile ambients
• Elimination of spatial connectives in static spatial logics
• When ambients cannot be opened
• Model checking mobile ambients
• Nesting analysis of mobile ambients
• A spatial logic for concurrency. I
• Elimination of quantifiers and undecidability in spatial logics for concurrency
• Spatial congruence for ambients is decidable
• The complexity of model checking mobile ambients
• Intensionality of modal logic for robust ambient calculus
• A semiring-based quantitative analysis of mobile systems
• Undecidability of model checking in brane logic
• Formal Modeling of Mobile Computing Systems Based on Ambient Abstract State Machines
• Separability in the Ambient Logic
• A Complete Axiomatic System for a Process-Based Spatial Logic
• Decidable Extensions of Hennessy-Milner Logic
• On Model Checking Boolean BI
• Deciding reachability problems in Turing-complete fragments of Mobile Ambients
• Reachability problems in BioAmbients
• scientific article; zbMATH DE number 2038740 (Why is no real title available?)
• scientific article; zbMATH DE number 2087553 (Why is no real title available?)
• Deciding reachability in mobile ambients with name restriction
• Specification and verification for semi-structured data
• Foundations of Software Science and Computation Structures
• On the expressiveness and decidability of higher-order process calculi
• On decidability of the bisimilarity on higher-order processes with parameterization
• Axiomatisation and decidability of multi-dimensional Duration Calculus

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

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