共 50 条
- [31] Computational Complexity of DECLARE Relation Problem for Sound non-Free-Choice Workflow Nets 2020 59TH ANNUAL CONFERENCE OF THE SOCIETY OF INSTRUMENT AND CONTROL ENGINEERS OF JAPAN (SICE), 2020, : 1569 - 1574
- [32] Deadlock analysis and routing on Free-choice Multipart Reentrant Flow lines using a matrix-based discrete event controller PROCEEDINGS OF THE 41ST IEEE CONFERENCE ON DECISION AND CONTROL, VOLS 1-4, 2002, : 793 - 798
- [34] Properties and applications of synchronized choice Petri nets 2001 IEEE INTERNATIONAL CONFERENCE ON SYSTEMS, MAN, AND CYBERNETICS, VOLS 1-5: E-SYSTEMS AND E-MAN FOR CYBERNETICS IN CYBERSPACE, 2002, : 2742 - 2747
- [35] Protocol Inheritance Preserving Soundizability Problem and Its Polynomial Time Procedure for Acyclic Free Choice Workflow Nets IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, 2014, E97D (05): : 1181 - 1187
- [38] Reachability of nonsynchronized choice Petri nets and its applications IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS PART B-CYBERNETICS, 2005, 35 (06): : 1203 - 1213
- [39] Necessary and sufficient condition for liveness of asymmetric choice Petri nets IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 1997, E80A (03): : 521 - 533