共 50 条
- [1] Generalized submarking reachability problems under unknown firing count vectors and their inverse problems of Petri nets APCCAS '96 - IEEE ASIA PACIFIC CONFERENCE ON CIRCUITS AND SYSTEMS '96, 1996, : 476 - 479
- [2] Reachability criterion of live free choice Petri nets APCCAS '96 - IEEE ASIA PACIFIC CONFERENCE ON CIRCUITS AND SYSTEMS '96, 1996, : 350 - 353
- [6] Compositional reachability in petri nets Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2014, 8762 : 230 - 243
- [7] Algorithm for the set of generators of an arbitrary firing count vector in Petri nets SICE 2002: PROCEEDINGS OF THE 41ST SICE ANNUAL CONFERENCE, VOLS 1-5, 2002, : 847 - 852
- [8] A reachability graph construction algorithm based on canonical transition firing count vectors 9TH INTERNATIONAL WORKSHOP ON PETRI NETS AND PERFORMANCE MODELS, PROCEEDINGS, 2001, : 113 - 122
- [9] The Reachability Problem for Petri Nets Is Not Elementary PROCEEDINGS OF THE 51ST ANNUAL ACM SIGACT SYMPOSIUM ON THEORY OF COMPUTING (STOC '19), 2019, : 24 - 33
- [10] On Achieving Reachability Paths of Petri nets 2015 9TH INTERNATIONAL CONFERENCE ON ELECTRICAL AND ELECTRONICS ENGINEERING (ELECO), 2015, : 724 - 728