English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
 
 
DownloadE-Mail
 Local TagsRelease HistoryDetailsSummary
  The Decidability of Model Checking Mobile Ambients

Charatonik, W., & Talbot, J.-M. (2001). The Decidability of Model Checking Mobile Ambients. In L. Fribourg (Ed.), Computer science logic (CSL-01): 15th International Workshop, CSL 2001, Annual Conference of the EACSL (pp. 339-354). Berlin, Germany: Springer.

Item is

 

show all hide all

Basic

show hide
Item Permalink: https://hdl.handle.net/11858/00-001M-0000-000F-324F-5 Version Permalink: https://hdl.handle.net/11858/00-001M-0000-000F-3251-E
Genre: Conference Paper

Files

show Files

Locators

show

Creators

show
hide
 Creators:
Charatonik, Witold1, Author           
Talbot, Jean-Marc1, Author           
Affiliations:
1Programming Logics, MPI for Informatics, Max Planck Society, ou_40045              

Content

show
hide
Free keywords: -
 Abstract: The ambient calculus is a formalism for describing the mobility of both software and hardware. The ambient logic is a modal logic designed to specify properties of distributed and mobile computations programmed in the ambient calculus. In this paper we investigate the border between decidable and undecidable cases of model checking mobile ambients for some fragments of the ambient calculus and the ambient logic. Recently, Cardelli and Gordon presented a model-checking algorithm for a fragment of the calculus (without name restriction and without replication) against a fragment of the logic (without composition adjunct) and asked the question, whether this algorithm could be extended to include either replication in the calculus or composition adjunct in the logic. Here we answer this question negatively: it is not possible to extend the algorithm, because each of these extensions leads to undecidability of the problem. On the other hand, we extend the algorithm to the calculus with name restriction and logic with new constructs for reasoning about restricted names.

Details

show
hide
Language(s): eng - English
 Dates: 2010-03-122001
 Publication Status: Issued
 Pages: -
 Publishing info: -
 Table of Contents: -
 Rev. Type: -
 Identifiers: eDoc: 519815
Other: Local-ID: C1256104005ECAFC-22156CFDF093BF99C1256AA00045C40A-CharatonikTalbot-csl01
 Degree: -

Event

show
hide
Title: Untitled Event
Place of Event: Paris, France
Start-/End Date: 2003-05-14 - 2003-05-18

Legal Case

show

Project information

show

Source 1

show
hide
Title: Computer science logic (CSL-01) : 15th International Workshop, CSL 2001, Annual Conference of the EACSL
Source Genre: Proceedings
 Creator(s):
Fribourg, Laurent, Editor
Affiliations:
-
Publ. Info: Berlin, Germany : Springer
Pages: - Volume / Issue: - Sequence Number: - Start / End Page: 339 - 354 Identifier: ISBN: 3-540-42554-3

Source 2

show
hide
Title: Lecture Notes in Computer Science
Source Genre: Series
 Creator(s):
Affiliations:
Publ. Info: -
Pages: - Volume / Issue: 2142 Sequence Number: - Start / End Page: - Identifier: -