共 50 条
- [22] Parameterized Complexity Results for 1-safe Petri Nets CONCUR 2011: CONCURRENCY THEORY, 2011, 6901 : 358 - 372
- [23] On the Parameterized Complexity of Synthesizing Boolean Petri Nets With Restricted Dependency ELECTRONIC PROCEEDINGS IN THEORETICAL COMPUTER SCIENCE, 2020, (324): : 78 - 95
- [25] Parameterized Complexity and Approximability of Coverability Problems in Weighted Petri Nets APPLICATION AND THEORY OF PETRI NETS AND CONCURRENCY, PETRI NETS 2017, 2017, 10258 : 330 - 349
- [26] A polynomial complexity algorithm to decide the liveness for a class of Petri nets 2005 INTERNATIONAL CONFERENCE ON CONTROL AND AUTOMATION (ICCA), VOLS 1 AND 2, 2005, : 1175 - 1180
- [27] Structural complexity analysis of information systems based on Petri nets J Beijing Inst Technol Engl Ed, 4 (416-423):
- [28] The Ordinal-Recursive Complexity of Timed-Arc Petri Nets, Data Nets, and Other Enriched Nets 2012 27TH ANNUAL ACM/IEEE SYMPOSIUM ON LOGIC IN COMPUTER SCIENCE (LICS), 2012, : 355 - 364
- [29] Complexity metrics for Petri net based logic control algorithms SMC 2000 CONFERENCE PROCEEDINGS: 2000 IEEE INTERNATIONAL CONFERENCE ON SYSTEMS, MAN & CYBERNETICS, VOL 1-5, 2000, : 1204 - 1209