Deciding Reachability in Mobile Ambients with Name Restriction
From MaRDI portal
Publication:5179047
DOI10.1016/j.entcs.2009.05.027zbMath1347.68262MaRDI QIDQ5179047
Roberto Montagna, Giorgio Delzanno
Publication date: 19 March 2015
Published in: Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.entcs.2009.05.027
68Q60: Specification and verification (program logics, model checking, etc.)
68Q85: Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.)
68Q42: Grammars and rewriting systems
Related Items
Reachability problems in BioAmbients, Multiset rewriting for the verification of depth-bounded processes with name binding
Cites Work
- Unnamed Item
- Unnamed Item
- Reachability analysis of fragments of mobile ambients in AC term rewriting
- Mobile ambients
- On the computational strength of pure ambient calculi
- When ambients cannot be opened
- Process rewrite systems.
- On the expressive power of movement and restriction in pure mobile ambients
- Model checking mobile ambients
- Anytime, anywhere
- Programming Languages and Systems