Reachability analysis of fragments of mobile ambients in AC term rewriting

DOI10.1007/S00165-008-0081-8zbMath1149.68041OpenAlexW2075788396WikidataQ130974875 ScholiaQ130974875MaRDI QIDQ939167

Giorgio Delzanno, Roberto Montagna

Publication date: 21 August 2008

Published in: Formal Aspects of Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00165-008-0081-8

zbMATH Keywords

Petri netsReachabilityTerm rewritingMobile ambients

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Grammars and rewriting systems (68Q42)

Related Items (2)

Deciding Reachability in Mobile Ambients with Name Restriction ⋮ Multiset rewriting for the verification of depth-bounded processes with name binding

Uses Software

• Timbuk

Cites Work

• Deterministic tree pushdown automata and monadic tree rewriting systems
• Mobile ambients
• On the computational strength of pure ambient calculi
• When ambients cannot be opened
• Process rewrite systems.
• Reachability Analysis of Mobile Ambients in Fragments of AC Term Rewriting
• An Algorithm for the General Petri Net Reachability Problem
• Programming Languages and Systems
• Theoretical Computer Science

This page was built for publication: Reachability analysis of fragments of mobile ambients in AC term rewriting