Symbolic Proof of CTL Formulae over Petri Nets

We present a method for proving properties of Petri nets expressed in the branching time temporal logic CTL. The framework of CTL formulae, viewed through the notions of predicates and predicate transformers in the context of Petri nets, is also presented. By overcoming the normal limitation of model checking which restricts its applicability to finite state systems this improvement will allow the use of symbolic model checking. The new concept of predicate structure, a symbolic representation of a set of markings of a Petri net, is defined together with a set of associated operations.


Published in:
8th International Symposium on Computer and Information Sciences, Istambul, November 3-5 1993, 189-196
Year:
1993
Keywords:
Laboratories:




 Record created 2005-09-20, last modified 2018-01-27

External link:
Download fulltext
n/a
Rate this document:

Rate this document:
1
2
3
 
(Not yet reviewed)