A Polynomial Translation of Mobile Ambients into Safe Petri NetsFurther Remarks
A Polynomial Translation of Mobile Ambients into Safe Petri Nets: Further Remarks
Göbel, Susanne
2016-01-23 00:00:00
[We conclude this work by discussing how to improve the analysis of MA processes with the insights that we gained. The relaxed semantics proposed in Section 4.1.1 provides interesting approaches for future work by allowing a divide and conquer approach to the decision of MA reachability. The idea is applicable to an (r)MA term as well as to an MA-PN marking. Section 4.1.2 extends the bisimilarity to arbitrary MA processes and the reachability results for b, d-bounded processes to bounded runs of unbounded processes and shows an examplary usage.]
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-Jq9eLUGaw9
A Polynomial Translation of Mobile Ambients into Safe Petri NetsFurther Remarks
[We conclude this work by discussing how to improve the analysis of MA processes with the insights that we gained. The relaxed semantics proposed in Section 4.1.1 provides interesting approaches for future work by allowing a divide and conquer approach to the decision of MA reachability. The idea is applicable to an (r)MA term as well as to an MA-PN marking. Section 4.1.2 extends the bisimilarity to arbitrary MA processes and the reachability results for b, d-bounded processes to bounded runs of unbounded processes and shows an examplary usage.]
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.