Skip to main content

Efficiency of Asynchronous Systems That Communicate Asynchronously

  • Conference paper
  • First Online:
Application and Theory of Petri Nets 2000 (ICATPN 2000)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1825))

Included in the following conference series:

Abstract

A parallel composition is introduced that combines nets (regarded as system components) by merging so-called interface places; the novel feature is a flexible typing of these places, which formulates assumptions a component makes about its environment. Based on a testing scenario, a faster-than relation is defined and shown to support modular construction, since it is a precongruence for parallel composition, hiding and renaming. The faster-than relation is characterized without reference to tests, and this characterization is used to compare the temporal efficiency of some examples.

This work was partially supported by the DFG-project ‘Halbordnungstesten’.

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

Access this chapter

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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. E. Best, R. Devillers, and J. Esparza. General Refinement and Recursion for the Box Calculus. In P. Enjalbert, A. Finkel, and K. W. Wagner, editors, STACS’93, Lect. Notes Comp. Sci. 665, 130–140. Springer, 1993.

    Google Scholar 

  2. E. Bihler. Effizienzvergleich bei verteilten Systemen-eine Theorie und ein Werkzeug. Diplomarbeit an der Uni. Augsburg, 1998.

    Google Scholar 

  3. E. Bihler and W. Vogler. Efficiency of token-passing MUTEX-solutions — some experiments. In J. Desel et al., editors, Applications and Theory of Petri Nets 1998, Lect. Notes Comp. Sci. 1420, 185–204. Springer, 1998.

    Google Scholar 

  4. G. Chehaibar. Replacement of open interface subnets and stable state transformation equivalence. In Proc. 12th Int. Conf. Applications and Theory of Petri Nets, Gjern, 390–409, 1991.

    Google Scholar 

  5. R. Cleaveland and A. Zwarico. A theory of testing for real-time. In Proc. 6th Symp. on Logic in Computer Science, pages 110–119. IEEE Computer Society Press, 1991.

    Google Scholar 

  6. F.S. de Boer, J.N. Kok, C. Palamidessi, and J.J.M.M. Rutten. The failure of failures in a paradigm for asynchronous communication. In J.C.M. Baeten and J.F. Groote, editors, CONCUR’ 91, Lect. Notes Comp. Sci. 527, 111–126. Springer, 1991.

    Google Scholar 

  7. F.S. de Boer and G. Zavaratto. Generic process algebras for asynchronous communication. In J.C.M. Baeten and S. Mauw, editors, CONCUR’ 99, Lect. Notes Comp. Sci. 1664, 226–241. Springer, 1999.

    Google Scholar 

  8. R. De Nicola and M.C.B. Hennessy. Testing equivalence for processes. Theoret. Comput. Sci., 34:83–133, 1984.

    Article  MathSciNet  Google Scholar 

  9. D. Gomm. Modellierung und Analyse verzögerungs-unabhängiger Schaltungen mit Petrinetzen. PhD thesis, Techn. Univ. München, Dieter Bertz Verlag, 1996.

    Google Scholar 

  10. E. Kindler. A compositional partial order semantics for Petri net components. In P. Azema et al., editors, Applications and Theory of Petri Nets 1997, Lect. Notes Comp. Sci. 1248, 235–252. Springer, 1997.

    Google Scholar 

  11. N. Lynch and F. Vaandrager. Forward and backward simulations I: Untimed systems. Information and Computation, 121:214–233, 1995.

    Article  MathSciNet  Google Scholar 

  12. N. Lynch. Distributed Algorithms. Morgan Kaufmann Publishers, San Francisco, 1996.

    MATH  Google Scholar 

  13. V. Natarajan and R. Cleaveland. An algebraic theory of process efficiency. In 11th Ann. Symp. Logic in Computer Science (LICS’ 96), 63–72. IEEE, 1996.

    Google Scholar 

  14. G. Peterson and M. Fischer. Economical solutions for the critical section problem in a distributed system. In 9th ACM Symp. Theory of Computing, pages 91–97, 1977.

    Google Scholar 

  15. L. Popova. On time Petri nets. J. Inform. Process. Cybern. EIK, 27:227–244, 1991.

    MATH  Google Scholar 

  16. P. Senac, M. Diaz, and P. de Saqui-Sannes. Toward a formal specification of multimedia synchronization scenarios. Ann. of telecommunications, 49:297–314, 1994.

    Article  Google Scholar 

  17. A. Valmari. Compositional Analysis with Place-Ordered Subnets. In R. Valette, editor, Application and Theory of Petri Nets’ 94, Lect. Notes Comp. Sci. 815, 531–547. Springer, 1994.

    Google Scholar 

  18. W. Vogler. Modular Construction and Partial Order Semantics of Petri Nets. Lect. Notes Comp. Sci. 625. Springer, 1992.

    Google Scholar 

  19. W. Vogler. Faster asynchronous systems. In I. Lee and S. Smolka, editors, CONCUR 95, Lect. Notes Comp. Sci. 962, 299–312. Springer, 1995. Full version as Report Nr. 317, Inst. f. Mathematik, Univ. Augsburg, 1995.

    Google Scholar 

  20. W. Vogler. Efficiency of asynchronous systems and read arcs in Petri nets. In P. Degano, R. Gorrieri, and A. Marchetti-Spaccamela, editors, ICALP 97, Lect. Notes Comp. Sci. 1256, 538–548. Springer, 1997.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Vogler, W. (2000). Efficiency of Asynchronous Systems That Communicate Asynchronously. In: Nielsen, M., Simpson, D. (eds) Application and Theory of Petri Nets 2000. ICATPN 2000. Lecture Notes in Computer Science, vol 1825. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44988-4_24

Download citation

  • DOI: https://doi.org/10.1007/3-540-44988-4_24

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-67693-5

  • Online ISBN: 978-3-540-44988-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics