DocumentCode :
320831
Title :
Efficient verification using generalized partial order analysis
Author :
Vercauteren, Steven ; Verkest, D. ; De Jong, Gjalt ; Lin, Bill
Author_Institution :
IMEC, Leuven, Belgium
fYear :
1998
fDate :
23-26 Feb 1998
Firstpage :
782
Lastpage :
789
Abstract :
This paper presents a new formal method for the efficient verification of concurrent systems that are modeled using a safe Petri net representation. Our method generalizes upon partial-order methods to explore concurrently enabled conflicting paths simultaneously. We show that our method can achieve an exponential reduction in algorithmic complexity without resorting to an implicit enumeration approach
Keywords :
Petri nets; computational complexity; formal verification; multiprocessing systems; Petri net representation; algorithmic complexity reduction; concurrent systems; formal method; generalized partial order analysis; partial-order methods; verification; Algorithm design and analysis; Analytical models; Embedded system; Explosions; Formal verification; Laboratories; Petri nets; Reachability analysis; State-space methods; Telecommunications;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Design, Automation and Test in Europe, 1998., Proceedings
Conference_Location :
Paris
Print_ISBN :
0-8186-8359-7
Type :
conf
DOI :
10.1109/DATE.1998.655947
Filename :
655947
Link To Document :
بازگشت