A Polynomial Translation of Mobile Ambients into Safe Petri NetsBackground
A Polynomial Translation of Mobile Ambients into Safe Petri Nets: Background
Göbel, Susanne
2016-01-23 00:00:00
[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.]
http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.pnghttp://www.deepdyve.com/lp/springer-journals/a-polynomial-translation-of-mobile-ambients-into-safe-petri-nets-FlRM0mLqW3
A Polynomial Translation of Mobile Ambients into Safe Petri NetsBackground
[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.]
Published: Jan 23, 2016
Keywords: Model Check; Reachability Problem; Bound Model Check; Silent Action; Weak Bisimulation
To get new article updates from a journal on your personalized homepage, please log in first, or sign up for a DeepDyve account if you don’t already have one.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.