Deciding Properties of Timed Transition Models
IEEE Transactions on Parallel and Distributed Systems
| Hi-index | 0.00 |
This paper explores the three important classes of temporal properties of concurrent programs: invariance, liveness and precedence. It presents the first methodological approach to the precedence properties, while providing a review of the invariance and liveness properties. The approach is based on the ''unless'' operator, which is a weak version of the ''until'' operator. For each class of properties, we present a single complete proof principle. Finally, we show that the properties of each class are decidable over finite state programs.