Abstract
We start by introducing the related literature on both the Mobile Ambient (MA) calculus and its ancestor the π-calculus. Both calculi are Turing-complete in general form so that reachability is undecidable. Still, many results exist that prove reachability for restricted subclasses but most of these classes for MA are syntactically restricted so that certain language constructs are excluded.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2016 Springer Fachmedien Wiesbaden
About this chapter
Cite this chapter
Göbel, S. (2016). Background. In: A Polynomial Translation of Mobile Ambients into Safe Petri Nets. BestMasters. Springer Vieweg, Wiesbaden. https://doi.org/10.1007/978-3-658-11765-8_1
Download citation
DOI: https://doi.org/10.1007/978-3-658-11765-8_1
Published:
Publisher Name: Springer Vieweg, Wiesbaden
Print ISBN: 978-3-658-11764-1
Online ISBN: 978-3-658-11765-8
eBook Packages: Computer ScienceComputer Science (R0)