Skip Navigation

The Computer Journal 2001 44(2):124-136; doi:10.1093/comjnl/44.2.124
© 2001 by British Computer Society
This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in ISI Web of Science
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrow Search for citing articles in:
ISI Web of Science (8)
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Chao, D. Y.
Right arrow Articles by Nicdao, J. A.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Liveness for Synchronized Choice Petri Nets

Daniel Y. Chao1 and Jose A. Nicdao2

1 Department of Management and Information Science, National Cheng Chi University, Taipei, Taiwan, ROC Email: yaw@mis.nccu.edu.tw 2 Institute of Information Industry, Taipei, Taiwan

Unlike traditional classification by output conditions of places, synchronized choice nets were defined as a new class of nets characterized by local structures. This paper investigates its liveness. The time required to examine local structures is less than that required to examine global structures (via structure objects). Thus polynomial time algorithms can be developed to verify the liveness property of Petri nets.

Received 11 August, 1999. Revised 1 December, 2000.


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.