Skip to main content
SpringerLink
Log in

A New Type of Behaviour-Preserving Transition Insertions in Unfolding Prefixes

  • Conference paper
Graph Transformations (ICGT 2010)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 6372))

Included in the following conference series:

Abstract

A new kind of behaviour-preserving insertions of new transitions in Petri nets is proposed, and a method for computing such insertions using a complete unfolding prefix of the Petri net is developed. Moreover, as several transformations often have to be applied one after the other, the developed theory allows one to avoid (expensive) re-unfolding after each transformation, and instead use local modifications on the existing complete prefix to obtain a complete prefix of the modified net.

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. Chu, T.A.: Synthesis of Self-Timed VLSI Circuits from Graph-Theoretic Specifications. Ph.D. thesis, Lab. for Comp. Sci. MIT (1987)

    Google Scholar 

  2. Cohn, P.: Universal Algebra, 2nd edn. Reidel, Dordrecht (1981)

    MATH  Google Scholar 

  3. Engelfriet, J.: Branching processes of Petri nets. Acta Inf. 28, 575–591 (1991)

    Article  MATH  MathSciNet  Google Scholar 

  4. Esparza, J., Römer, S., Vogler, W.: An improvement of McMillan’s unfolding algorithm. FMSD 20(3), 285–310 (2002)

    MATH  Google Scholar 

  5. Khomenko, V.: Model Checking Based on Prefixes of Petri Net Unfoldings. Ph.D. thesis, School of Comp. Sci., Newcastle Univ. (2003)

    Google Scholar 

  6. Khomenko, V.: Behaviour-preserving transition insertions in unfolding prefixes. In: Kleijn, J., Yakovlev, A. (eds.) ICATPN 2007. LNCS, vol. 4546, pp. 204–222. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  7. Khomenko, V.: Efficient automatic resolution of encoding conflicts using STG unfoldings. IEEE Trans. VLSI Syst. 17(7), 855–868 (2009); Special section on asynchronous circuits and systems

    Google Scholar 

  8. Khomenko, V.: A new type of behaviour-preserving transition insertions in unfolding prefixes. Tech. Rep. CS-TR-1189, School of Comp. Sci., Newcastle Univ. (2010), http://www.cs.ncl.ac.uk/publications/trs/papers/1189.pdf

  9. Khomenko, V., Koutny, M., Vogler, V.: Canonical prefixes of Petri net unfoldings. Acta Inf. 40(2), 95–118 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  10. Murata, T.: Petri nets: Properties, analysis and applications. Proc. of the IEEE 77(4), 541–580 (1989)

    Article  Google Scholar 

  11. Rosenblum, L., Yakovlev, A.: Signal graphs: from self-timed to timed ones. In: Proc. Workshop on Timed Petri Nets, pp. 199–206. IEEE Comp. Soc. Press, Los Alamitos (1985)

    Google Scholar 

  12. Vanbekbergen, P., Catthoor, F., Goossens, G., De Man, H.: Optimized synthesis of asynchronous control circuits from graph-theoretic specifications. In: Proc. ICCAD 1990, pp. 184–187. IEEE Comp. Soc. Press, Los Alamitos (1990)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Computing Science, Newcastle University, UK

    Victor Khomenko

Authors
  1. Victor Khomenko
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institut für Softwaretechnik und Theoretische Informatik, Technische Universität Berlin, Franklinstr. 28/29, 10587, Berlin, Germany

    Hartmut Ehrig

  2. Afdeling Informatica, Universiteit Twente, Drienerlolaan 5, 7522, Enschede, NB, The Netherlands

    Arend Rensink

  3. Leiden Institute of Advanced Computer Science (LIACS), Universiteit Leiden, Niels Bohrweg 1, 2333, Leiden, CA, The Netherlands

    Grzegorz Rozenberg

  4. Fachgebiet Echtzeitsysteme, Technische Universität Darmstadt, Merckstraße 25, 64283, Darmstadt, Germany

    Andy Schürr

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Khomenko, V. (2010). A New Type of Behaviour-Preserving Transition Insertions in Unfolding Prefixes. In: Ehrig, H., Rensink, A., Rozenberg, G., Schürr, A. (eds) Graph Transformations. ICGT 2010. Lecture Notes in Computer Science, vol 6372. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-15928-2_6

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-15928-2_6

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-15927-5

  • Online ISBN: 978-3-642-15928-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation