|
| << previous | next >> |
Journal description
All volumes of the corresponding journal
All issues of the corresponding volume
All articles of the corresponding issues
Details for article 8 of 9 found articles
| Title: |
Using State Equation to Prove Non-Reachability in Timed Petrinets |
| Author: |
Louchka Popova-Zeugmann Matthias Werner Jan Richling |
| Appeared in: |
Fundamenta informaticae |
| Paging: | Volume 55 (2003) nr. 2 pages 187-202 |
| Year: |
2003-10-01 |
| Contents: |
Non-reachability proofs in Timed Petrinets were usually done by proving the non-reachability within the underlying timeless net. However, in many cases this approach fails. In this paper, we present an approach to prove non-reachability within the actual Timed Petrinet. For this purpose, we introduce a state equation for Timed Petrinets in analogy to timeless nets. Using this state equation, we can express reachability as a system of equations and inequations, which is solvable in polynomial time. |
| Publisher: |
IOS Press |
| Source file: |
Elektronische Wetenschappelijke Tijdschriften |
Details for article 8 of 9 found articles
| << previous | next >> |