Skip to main content
SpringerLink
Log in
Book cover

International Conference on Application and Theory of Petri Nets

ICATPN 2002: Application and Theory of Petri Nets 2002 pp 434–444Cite as

Maria: Modular Reachability Analyser for Algebraic System Nets

  • Conference paper
  • First Online:

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

Abstract

Maria performs simulation, exhaustive reachability analysis and on-the-fly LTL model checking of high-level Petri nets with fairness constraints. The algebra contains powerful built-in data types and operations. Models can be exported to low-level Petri nets and labelled transition systems. Translator programs allow Maria to analyse transition systems as well as distributed computer programs written in procedural or object-oriented languages, or high-level specifications such as SDL. Maria has been implemented in portable C and C++, and it is freely available under the conditions of the GNU General Public License.

This research was financed by the Helsinki Graduate School on Computer Science and Engineering, the National Technology Agency of Finland (TEKES), the Nokia Corporation, Elisa Communications, the Finnish Rail Administration, EKE Electronics and Genera, and by a personal grant from Tekniikan Edistämissäätiö.

This is a preview of subscription content, 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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. José-Manuel Colom and Maciej Koutny, editors, Application and Theory of Petri Nets 2001, 22 nd International Conference, ICATPN 2001, volume 2075 of Lecture Notes in Computer Science, Newcastle upon Tyne, England, June 2001. Springer-Verlag.

    Google Scholar 

  2. James. C. Corbett, Matthew. B. Dwyer, John Hatcliff, Shawn Laubach, Corina S. Păsăreanu, Robby, and Hongjun Zheng. Bandera: Extracting finite-state models from Java source code. In Carlo Ghezzi, Mehdi Jazayeri and Alexander Wolf, editors, Proceedings of the 22 nd International Conference on Software Engineering, pages 439–448, Limerick, Ireland, June 2000. ACM Press, New York, NY, USA.

    Google Scholar 

  3. Emden R. Gansner and Stephen C. North. An open graph visualization system and its applications to software engineering. Software: Practice and Experience, 30(11):1203–1233, September 2000.

    Google Scholar 

  4. Rob Gerth, Doron Peled, Moshe Y. Vardi, and Pierre Wolper. Simple on-the-fly automatic verification of linear temporal logic. In Proceedings of the 15 th Workshop Protocol Specification, Testing, and Verification, Warsaw, June 1995. North-Holland.

    Google Scholar 

  5. Hartmann J. Genrich and Kurt Lautenbach. The analysis of distributed systems by means of Predicate/Transition-Nets. In Gilles Kahn, editor, Semantics of Concurrent Computation, volume 70 of Lecture Notes in Computer Science, pages 123–146, Evian, France, July 1979. Springer-Verlag, 1979.

    Chapter  Google Scholar 

  6. Patrice Godefroid, Doron Peled and Mark Staskauskas. Using partial-order methods in the formal validation of industrial concurrent programs. IEEE Transactions on Software Engineering, 22(7):496–507, July 1996.

    Google Scholar 

  7. Bernd Grahlmann. The state of PEP. In Armando M. Haeberer, editor, Algebraic Methodology and Software Technology, 7 th International Conference, AMAST’98, Amazonia, Brazil, volume 1548 of Lecture Notes in Computer Science, pages 522–526, Manaus, Brazil, January 1999. Springer-Verlag.

    Google Scholar 

  8. Nisse Husberg and Tapio Manner. Emma: Developing an industrial reachability analyser for SDL. In World Congress on Formal Methods, volume 1708 of Lecture Notes in Computer Science, pages 642–661, Toulouse, France, September 1999. Springer-Verlag.

    Google Scholar 

  9. Tommi Junttila. Finding symmetries of algebraic system nets. Fundamenta Informaticae, 37(3):269–289, February 1999.

    Google Scholar 

  10. Ekkart Kindler and Hagen Völzer. Flexibility in algebraic nets. In Jörg Desel and Manuel Silva, editors, Application and Theory of Petri Nets 1998: 19 th International Conference, ICATPN’98, volume 1420 of Lecture Notes in Computer Science, pages 345–364, Lisbon, Portugal, June 1998. Springer-Verlag.

    Chapter  Google Scholar 

  11. Orna Kupferman and Moshe Y. Vardi. Model checking of safety properties. In Nicolas Halbwachs and Doron Peled, editors, Computer Aided Verification: 11 th International Conference, CAV’99, volume 1633 of Lecture Notes in Computer Science, pages 172–183, Trento, Italy, July 1999. Springer-Verlag.

    Chapter  Google Scholar 

  12. Timo Latvala and Keijo Heljanko. Coping with strong fairness. Fundamenta Informaticae, 43(1–4):175–193, 2000.

    MATH  MathSciNet  Google Scholar 

  13. Timo Latvala. Model checking LTL properties of high-level Petri nets with fairness constraints. In Maciej Koutny, editors, Application and Theory of Petri Nets 2001, 22 nd International Conference, ICATPN 2001, volume 2075 of Lecture Notes in Computer Science, Newcastle upon Tyne, England, June 2001. Springer-Verlag [1], pages 242–262.

    Chapter  Google Scholar 

  14. Glenn Lewis and Charles Lakos. Incremental state space construction for coloured Petri nets. In Maciej Koutny, editors, Application and Theory of Petri Nets 2001, 22 nd International Conference, ICATPN 2001, volume 2075 of Lecture Notes in Computer Science, Newcastle upon Tyne, England, June 2001. Springer-Verlag [1], pages 263–282.

    Chapter  Google Scholar 

  15. Marko Mäkelä. Condensed storage of multi-set sequences. In Workshop on the Practical Use of High-Level Petri Nets, Århus, Denmark, June 2000.

    Google Scholar 

  16. Marko Mäkelä. Applying compiler techniques to reachability analysis of high-level models. In Hans-Dieter Burkhard, Ludwik Czaja, Andrzej Skowron and Mario Lenz, editors, Workshop Concurrency, Specification & Programming 2000, Informatik-Bericht 140, pages 129–141. Humboldt-Universität zu Berlin, Germany, October 2000.

    Google Scholar 

  17. Marko Mäkelä. A reachability analyser for algebraic system nets. Research report A69, Helsinki University of Technology, Laboratory for Theoretical Computer Science, Espoo, Finland, June 2001.

    Google Scholar 

  18. Marko Mäkelä. Optimising enabling tests and unfoldings of algebraic system nets. In Maciej Koutny, editors, Application and Theory of Petri Nets 2001, 22 nd International Conference, ICATPN 2001, volume 2075 of Lecture Notes in Computer Science, Newcastle upon Tyne, England, June 2001. Springer-Verlag [1], pages 283–302.

    Chapter  Google Scholar 

  19. Marko Mäkelä. Efficiently verifying safety properties with idle office computers. Unpublished manuscript.

    Google Scholar 

  20. Marko Mäkelä. Maria. On-line documentation, http://www.tcs.hut.fi/maria/.

  21. Leo Ojala, Nisse Husberg and Teemu Tynjälä. Modelling and analysing a distributed dynamic channel allocation algorithm for mobile computing using high-level net methods. International Journal on Software Tools for Technology Transfer, 3(4):382–393, 2001.

    MATH  Google Scholar 

  22. Karsten Schmidt. LoLA: A low level analyser. In Mogens Nielsen and Dan Simpson, editors, Application and Theory of Petri Nets 2001, 21 st International Conference, ICATPN 2000, volume 1825 of Lecture Notes in Computer Science, pages 465–474, Århus, Denmark, June 2000. Springer-Verlag.

    Google Scholar 

  23. André Schulz and Teemu Tynjälä. Translation rules from standard SDL to Maria input language. In Nisse Husberg, Tomi Janhunen and Ilkka Niemelä, editors, Leksa Notes in Computer Science: Festschrift in Honour of Professor Leo Ojala, Research Report 63, Helsinki University of Technology, Laboratory for Theoretical Computer Science, Espoo, Finland, October 2000.

    Google Scholar 

  24. Teemu Tynjälä, Sari Leppänen and Vesa Luukkala. Verifying reliable data transmission over UMTS radio interface with high level Petri nets. Unpublished manuscript.

    Google Scholar 

  25. Antti Valmari et al. Tampere Verification Tool. http://www.cs.tut.fi/ohj/VARG/.

  26. Kimmo Varpaaniemi, Jaakko Halme, Kari Hiekkanen and Tino Pyssysalo. PROD reference manual. Technical Report B13, Helsinki University of Technology, Digital Systems Laboratory, Espoo, Finland, August 1995.

    Google Scholar 

  27. Universal Mobile Telecommunications System (UMTS); RLC protocol specification (3GPP TS 25.322 version 3.5.0 Release 1999). ETSI TS 125 322 V3.5.0 (2000-12). European Telecommunications Standards Institute, December 2000.

    Google Scholar 

  28. Standard for Information Technology—Portable Operating System Interface. IEEE Std 1003.1-2001. Institute of Electrical and Electronics Engineers, New York, NY, USA, December 2001.

    Google Scholar 

  29. CCITT Specification and Description Language (SDL). Recommendation Z.100. International Telecommunication Union, Geneva, Switzerland, October 1996.

    Google Scholar 

  30. Message Sequence Chart (MSC). Recommendation Z.120. International Telecommunication Union, Geneva, Switzerland, November 1999.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Laboratory for Theoretical Computer Science, Helsinki University of Technology, P.O.Box 9700, 02015, HUT, Finland

    Marko Mäkelä

Authors
  1. Marko Mäkelä
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Division of Informatics, University of Edinburgh, James Clerk Maxwell Building, The King’s Buildings Mayfield Road, Edinburgh, EH9 3JZ, UK

    Javier Esparza

  2. Department of Computer Science, University of Adelaide, North Terrace, Adelaide, SA, 5005, Australia

    Charles Lakos

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Mäkelä, M. (2002). Maria: Modular Reachability Analyser for Algebraic System Nets. In: Esparza, J., Lakos, C. (eds) Application and Theory of Petri Nets 2002. ICATPN 2002. Lecture Notes in Computer Science, vol 2360. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48068-4_25

Download citation

  • DOI: https://doi.org/10.1007/3-540-48068-4_25

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-43787-1

  • Online ISBN: 978-3-540-48068-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation