Open access peer-reviewed chapter

Reachability Criterion with Sufficient Test Space for Ordinary Petri Net

By Gi Bum Lee, Han Zandong and Jin S. Lee

Submitted: December 3rd 2011Reviewed: June 7th 2012Published: August 29th 2012

DOI: 10.5772/50518

Downloaded: 778

© 2012 The Author(s). Licensee IntechOpen. This chapter is distributed under the terms of the Creative Commons Attribution 3.0 License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

How to cite and reference

Link to this chapter Copy to clipboard

Cite this chapter Copy to clipboard

Gi Bum Lee, Han Zandong and Jin S. Lee (August 29th 2012). Reachability Criterion with Sufficient Test Space for Ordinary Petri Net, Petri Nets Pawel Pawlewski, IntechOpen, DOI: 10.5772/50518. Available from:

Embed this chapter on your site Copy to clipboard

<iframe src="" />

Embed this code snippet in the HTML of your website to show this chapter

chapter statistics

778total chapter downloads

More statistics for editors and authors

Login to your personal dashboard for more detailed statistics on your publications.

Access personal reporting

Related Content

This Book

Next chapter

A Forward On-The-Fly Approach in Controller Synthesis of Time Petri Nets

By Parisa Heidari and Hanifa Boucheneb

Related Book

First chapter

An Application of GSPN for Modeling and Evaluating Local Area Computer Networks

By Masahiro Tsunoyama and Hiroei Imai

We are IntechOpen, the world's leading publisher of Open Access books. Built by scientists, for scientists. Our readership spans scientists, professors, researchers, librarians, and students, as well as business professionals. We share our knowledge and peer-reveiwed research papers with libraries, scientific and engineering societies, and also work with corporate R&D departments and government entities.

+3,550 Open Access Books

+57,400 Citations in Web of Science

+108,500 IntechOpen Authors and Academic Editors

+560,000 Unique visitors per month

More about us