Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

A Polynomial Translation of Mobile Ambients into Safe Petri NetsBackground

A Polynomial Translation of Mobile Ambients into Safe Petri Nets: Background [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.png

A Polynomial Translation of Mobile Ambients into Safe Petri NetsBackground

Loading next page...
 
/lp/springer-journals/a-polynomial-translation-of-mobile-ambients-into-safe-petri-nets-FlRM0mLqW3

References (0)

References for this paper are not available at this time. We will be adding them shortly, thank you for your patience.

Publisher
Springer Fachmedien Wiesbaden
Copyright
© Springer Fachmedien Wiesbaden 2016
ISBN
978-3-658-11764-1
Pages
1 –6
DOI
10.1007/978-3-658-11765-8_1
Publisher site
See Chapter on Publisher Site

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.]

Published: Jan 23, 2016

Keywords: Model Check; Reachability Problem; Bound Model Check; Silent Action; Weak Bisimulation

There are no references for this article.