✦ LIBER ✦

Deciding a Class of Path Formulas for Conflict-Free Petri Nets

✍ Scribed by Hsu-Chun Yen; Bow-Yaw Wang; Ming-Sheng Yang

Book ID: 105915263
Publisher: Springer
Year: 1997
Tongue: English
Weight: 239 KB
Volume: 30
Category: Article
ISSN: 1433-0490
DOI: 10.1007/s002240000063

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A valuation-based analysis of conflict-f

A valuation-based analysis of conflict-free Petri nets

✍ Hsu-Chun Yen 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 177 KB

A polynomial time algorithm to decide pa

A polynomial time algorithm to decide pairwise concurrency of transitions for 1-bounded conflict-free Petri nets

✍ Hsu-Chun Yen 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 677 KB

A solution to the covering problem for 1

A solution to the covering problem for 1-bounded conflict-free Petri nets using Linear Programming

✍ Javier Esparza 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 605 KB

Optimal stationary behavior for a class

Optimal stationary behavior for a class of timed continuous Petri nets

✍ Bruno Gaujal; Alessandro Giua 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 347 KB

Coverability graphs for a class of synch

Coverability graphs for a class of synchronously executed unbounded petri net

✍ P.David Stotts; Terrence W. Pratt 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 779 KB

Synchronous (or concurrent) transition firing rules for Petri nets are useful in modeling computations on real-time systems with multiple processors. A synchronous firing rule is one in which more than one transition may be fired to effect a single state change, allowing the physically concurrent op

A Petri net design of FPGA-based control

A Petri net design of FPGA-based controller for a class of nuclear I&C systems

✍ Chang-Kuo Chen 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 595 KB