Scenario-Based timing consistency checking for time petri nets
FORTE'06 Proceedings of the 26th IFIP WG 6.1 international conference on Formal Techniques for Networked and Distributed Systems
| Hi-index | 0.00 |
In this paper, we consider the problem of checking 1-safe time Petri nets for linear duration properties, which are linear inequalities on integrated durations of system states. By showing that a 1-safe time Petri net satisfies a linear duration property if and only if its integral behavior satisfies the linear duration property, we can give an algorithm that solves the problem based on investigating the integral state space of the 1-safe time Petri net. The algorithm is also improved to avoid exhaustive investigation of the state space.