Skip to main content
SpringerLink
Log in

Rewriting Logic and Elan: Prototyping Tools for Petri Nets with Time

  • Conference paper
  • First Online:
Applications and Theory of Petri Nets 2001 (ICATPN 2001)

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

Included in the following conference series:

Abstract

Rewriting logic (RL) is an extension of standard algebraic specification techniques which uses rewrite rules to model the dynamic behaviour of a system. In this paper we consider using RL and the associated support tool Elan as an environment for rapidly prototyping and analysing Petri nets with time. We link these algebraic tools to the existing Petri net tool PEP which we use to provide a user-friendly front end to our framework. Our flexible approach allows the wide range of possible time extensions presented in the literature to be investigated and thus overcomes one of the major drawbacks of the current hardwired tools. We demonstrate our ideas by considering time Petri nets in which transitions are associated with a time interval within which they can fire. The flexibility of our approach is illustrated by modelling a range of semantic alternatives for time Petri nets taken from the literature.

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

Access this chapter

Log in via an institution
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.

References

  1. T. Aura and J. Lilius. Time Processes for Time Petri Nets. In: 18th Int. Conf. on App. and Theory of Petri Nets, LNCS 1248, pages 136–155, Springer-Verlag, 1997.

    Google Scholar 

  2. B. Berthomieu and M. Diaz. Modeling and Verification of Time Dependent Systems using Time Petri Nets. IEEE Trans. on Software Engineering, 17(3):259–273, 1991.

    Article  MathSciNet  Google Scholar 

  3. E. Best and B. Grahlmann. PEP-more than a Petri Net Tool. In: T. Margaria and B. Steffen (eds), Proc. of TACAS’96: Tools and Algorithms for the Construction and Analysis of Systems, LNCS 1055, pp. 397–401, Springer-Verlag, 1996.

    Google Scholar 

  4. I. I. Bestuzheva and V. V. Rudnev. Timed Petri Nets: Classification and Comparative Analysis. Automation and Remote Control, 15(10):1303–1318, 1990.

    MathSciNet  Google Scholar 

  5. P. Borovansk’y. The Control of Rewriting: Study and Implementation of a Strategy Formalism. In: C. Kirchner and H. Kirchner (eds), Proceedings of WRLA’ 98, Electronic Notes in Theoretical Computer Science, Vol. 15, 1998.

    Google Scholar 

  6. P. Borovanskýy, C. Kirchner, H. Kirchner, P.-E. Moreau and M. Vittek. ELAN: A Logical Framework Based on Computational Systems. In: J. Meseguer (ed), Proceedings of WRLA’96, Electronic Notes in Theoretical Computer Science, Vol. 4, 1996.

    Google Scholar 

  7. P. Borovanskýy, C. Kirchner, H. Kirchner, P.-E. Moreau and C. Ringeissen. An overview of ELAN In: C. Kirchner and H. Kirchner (eds), Proceedings of WRLA’ 98, Electronic Notes in Theoretical Computer Science, Vol. 15, 1998.

    Google Scholar 

  8. P. Borovanskýy, H. Cirstea, H. Dubois, C. Kirchner, H. Kirchner, P.-E. Moreau, C. Ringeissen and M. Vittek. ELAN:User Manual. December, 1998. Available from: http://elan.loria.fr.

  9. Diaconescu, R., Futatsugi, K., Ishisone, M., Nakagawa, A. T. and Sawada, T. An Overview of CafeObj. In: C. Kirchner and H. Kirchner (eds), Proceedings of WRLA’ 98, Electronic Notes in Theoretical Computer Science, Vol. 15, 1998.

    Google Scholar 

  10. H. Ehrig and B. Mahr. Fundamentals of Algebraic Specification 1-Equations and Initial Semantics. EATCS Monographs on Theoretical Computer Science 6. Springer-Verlag, Berlin, 1985.

    Google Scholar 

  11. J. Loeckx, H-D. Ehrich and M. Wolf. Specification of Abstract Data Types. Wiley, 1996.

    Google Scholar 

  12. P. Merlin and D. J. Faber. Recoverability of communication protocols. IEEE Transactions on Communications, COM-24(9):1036–1049, 1976.

    Article  MATH  Google Scholar 

  13. J. Meseguer. Conditional rewriting logic as a unified model of concurrency. Theoretical Computer Science, 96:73–155, 1992.

    Article  MATH  MathSciNet  Google Scholar 

  14. J. Meseguer and U. Montanari. Petri nets are monoids. Information and Computation, 88:105–155, 1990.

    Article  MATH  MathSciNet  Google Scholar 

  15. T. Murata. Petri nets: properties, analysis and applications. Proceedings of the IEEE, 77(4):541–580, 1989.

    Article  Google Scholar 

  16. J. L. Peterson. Petri Nets. Computing Surveys, 9(3):223–252, 1977.

    Article  MATH  MathSciNet  Google Scholar 

  17. C. Ramchandani. Analysis of asynchronous concurrent systems by timed Petri nets. Project MAC Technical Report MAC-TR-120, Massachusetts Institute for Technology, Cambridge MA, 1974.

    Google Scholar 

  18. W. Reisig. Petri nets-an introduction. EATCS Monographs in Theoretical Computer Science, 4, Springer-Verlag, 1985.

    Google Scholar 

  19. P. Starke. A Memo on Time Constraints in Petri Nets. Informatik-Bericht Nr. 46, Institut für Informatik, Humboldt Universität, Berlin, 1995.

    Google Scholar 

  20. L. J. Steggles. Prototyping and Analysing Petri Nets with time: A Formal Investigation using Rewriting Logic and Elan. Technical Report No. 722, Department of Computing Science, University of Newcastle upon Tyne, 2001.

    Google Scholar 

  21. B. Walter. Timed Petri-Nets for Modelling and Analyzing Protocols with Real-Time Characteristics. In: H. Rudin and C. H. West (eds), Protocol Specification, Testing and Verification III, North-Holland, 1983.

    Google Scholar 

  22. W. M. Zuberek. Timed Petri Nets: Definitions, Properties and Applications. Microelectronics and Reliability, 31(4):627–644, 1991.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Newcastle, UK

    L. Jason Steggles

Authors
  1. L. Jason Steggles
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Departamento de Informática e Ingeniería de Sistemas Centro Politécnico Superior, Universidad de Zaragoza, María de Luna, 3, 50015, Zaragoza, Spain

    José-Manuel Colom

  2. Department of Computing Science, University of Newcastle upon Tyne, Newcastle upon Tyne, NE1 7RU, UK

    Maciej Koutny

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Steggles, L.J. (2001). Rewriting Logic and Elan: Prototyping Tools for Petri Nets with Time. In: Colom, JM., Koutny, M. (eds) Applications and Theory of Petri Nets 2001. ICATPN 2001. Lecture Notes in Computer Science, vol 2075. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45740-2_21

Download citation

  • DOI: https://doi.org/10.1007/3-540-45740-2_21

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-45740-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation