Skip to main content
SpringerLink
Log in

Reachability of LSFC Nets

  • Chapter
Realization and Modelling in System Theory

Part of the book series: Progress in Systems and Control Theory ((PSCT,volume 3))

  • 533 Accesses

Abstract

A reachability problem for live and safe free choice net (LSFC net) is considered in this paper. A necessary and sufficient condition for the reachability of a class of LSFC net is presented.

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.

Similar content being viewed by others

References

  1. M. Hack, “Analysis of Production Schemata by Petri Nets,” M. S. thesis, TR-94, Project MAC, MIT, Cambridge, Mass, 1972.

    Google Scholar 

  2. M. Hack, “Extended State-Machine Allocation Nets (ESMA), an extension of Free Choice Petri Net Results,” Computation group memo 78–1, Project MAC, MIT, Cambridge, Mass, 1974.

    Google Scholar 

  3. K. Hiraishi and A. Ichikawa, “A Class of Petri Nets for which a Necessary Sufficient Condition for Reachability is Obtainable,” Trans, of SICE Vol. 24, No. 6, June 1988, pp.635–640.

    Google Scholar 

  4. T. Murata, “Circuit Theoretic Analysis and Synthesis of Marked Graphs,” IEEE Trans, circuits and systems, Vol. CAS-24, No. 7, July 1977, pp. 400–405.

    Article  Google Scholar 

  5. W. Reisig, “Petri Nets,” Springer-Verlag, 1985.

    Google Scholar 

  6. P. S. Thiagarajan and K. Voss, “A Fresh Look At Free Choice Nets,” Information and Control 62, 1984, pp.85–113.

    Article  Google Scholar 

Download references

Authors
  1. Dong Ik Lee
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Sadatoshi Kumagai
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Shinzo Kodama
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Faculteit Wiskunde en Informatica, Vrije University, De Boelelaan 1081, 1081 HV, Amsterdam, The Netherlands

    M. A. Kaashoek  & A. C. M. Ran  & 

  2. Centre for Mathematics & Computer Science, P.O. Box 4079, 1009 AB, Amsterdam, The Netherlands

    J. H. van Schuppen

Rights and permissions

Reprints and permissions

Copyright information

© 1990 Birkhäuser Boston

About this chapter

Cite this chapter

Lee, D.I., Kumagai, S., Kodama, S. (1990). Reachability of LSFC Nets. In: Kaashoek, M.A., van Schuppen, J.H., Ran, A.C.M. (eds) Realization and Modelling in System Theory. Progress in Systems and Control Theory, vol 3. Birkhäuser Boston. https://doi.org/10.1007/978-1-4612-3462-3_59

Download citation

  • DOI: https://doi.org/10.1007/978-1-4612-3462-3_59

  • Publisher Name: Birkhäuser Boston

  • Print ISBN: 978-1-4612-8033-0

  • Online ISBN: 978-1-4612-3462-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation