Skip to main content

Studies on the Minimum Initial Marking of a Class of Hybrid Timed Petri Nets

  • Conference paper
Advances in Intelligent Computing (ICIC 2005)

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

Included in the following conference series:

  • 1039 Accesses

Abstract

For the minimum initial marking (MIM) problem is one of minimum resource allocation problems, it is significant to study the MIM problem for a class of hybrid timed Petri nets, called a hybrid timed event graph (HTEG). An HTEG has additional continuous places and continuous transitions than a timed event graph (TEG). By the construction of a new dioid endowed with the pointwise minimum as addition and the composition of functions as multiplication, a linear min-plus algebraic model of HTEG was derived. Based on the min-plus algebra and its properties, the MIM problem for HTEG was studied in the text.

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 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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. Baccelli, F., Cohen, G., Olsder, G.J., Quadrat, J.P.: Synchronization and Linearity: An Algebra for Discrete Event Systems. Wiley, New York (1992)

    MATH  Google Scholar 

  2. Cohen, G., Gaubert, S., Quadrat, J.P.: Timed-events graphs with multipliers and homogeneous Min-plus systems. IEEE Trans. on Automat. Contr. 43, 1296–1302 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  3. Huaping, D., Youxian, S.: An Algebraic Model for Performance Evaluation of Timed Event Multigraphs. IEEE Trans. on Automat. Contr. 48, 1227–1230 (2003)

    Article  Google Scholar 

  4. Cofer, D.D., Garg, V.K.: Supervisory Control of Real-Time Discrete-Event Systems Using Lattice Theory. IEEE Trans. on Automat. Contr. 41, 199–209 (1996)

    Article  MATH  MathSciNet  Google Scholar 

  5. Nishi, S., Taoka, S., Watanabe, T.: A new heuristic method for solving the minimum initial marking problem of Petri nets. In: 2000 IEEE International Conference on Systems, Man, and Cybernetics, vol. 5, pp. 3218–3223 (2000)

    Google Scholar 

  6. David, R., Alla, H.: Petri Nets Grafcet Tools for modeling discrete event systems, Hermes, France (1992)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Dai, H. (2005). Studies on the Minimum Initial Marking of a Class of Hybrid Timed Petri Nets. In: Huang, DS., Zhang, XP., Huang, GB. (eds) Advances in Intelligent Computing. ICIC 2005. Lecture Notes in Computer Science, vol 3645. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11538356_12

Download citation

  • DOI: https://doi.org/10.1007/11538356_12

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-28227-3

  • Online ISBN: 978-3-540-31907-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics