𝔖 Bobbio Scriptorium

✦ LIBER ✦

Polynomial-time algorithm for the legal firing sequences problem of a type of synchronous composition Petri nets

✍ Scribed by Changjun Jiang

Book ID: 110648429
Publisher: Science in China Press (SCP)
Year: 2001
Tongue: English
Weight: 597 KB
Volume: 44
Category: Article
ISSN: 1674-733X
DOI: 10.1007/bf02714572

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

[IEEE SICE Annual Conference 2007 - Taka

[IEEE SICE Annual Conference 2007 - Takamatsu, Japan (2007.09.17-2007.09.20)] SICE Annual Conference 2007 - A study on the decomposition of transition firing sequence problems for Petri Nets

✍ Shun Yoshie, ; Tatsushi Nishi, ; Masahiro Inuiguchi, 📂 Article 📅 2007 🏛 IEEE ⚖ 401 KB

[IEEE Communication Technologies, Resear

[IEEE Communication Technologies, Research, Innovation, and Vision for the Future (RIVF) - Ho Chi Minh City, Vietnam (2012.02.27-2012.03.1)] 2012 IEEE RIVF International Conference on Computing & Communication Technologies, Research, Innovation, and Vision for the Future - A Polynomial-Time Algorithm for Reachability Problem of a Subclass of Petri Net and Chip Firing Games

✍ Le, Manh Ha; Pham, Van Trung; Phan, Thi Ha Duong 📂 Article 📅 2012 🏛 IEEE ⚖ 208 KB