Skip to main content

Further Remarks

  • Chapter
  • First Online:
  • 302 Accesses

Part of the book series: BestMasters ((BEST))

Abstract

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.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Susanne Göbel .

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer Fachmedien Wiesbaden

About this chapter

Cite this chapter

Göbel, S. (2016). Further Remarks. 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_4

Download citation

  • DOI: https://doi.org/10.1007/978-3-658-11765-8_4

  • 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)

Publish with us

Policies and ethics