Efficient Verification using Generalized Partial Order Analysis

Paris, France February 23-February 26

DOI Bookmark:

http://doi.ieeecomputersociety.org/10.1109/DATE.1998.655947

Design Automation and Test in Europe ...

	This Article
	PURCHASE ARTICLE: $19 PDF HTML IEEE Xplore Subscribers
	Share
	Email this Article to a friend
	Bibliographic References
	ASCII Text BibTex RefWorks Procite/RefMan/Endnote
	Add to:
	Digg Furl Spurl Blink Simpy Google Del.icio.us Y!MyWeb
	Search
	Similar Articles Articles by Steven Vercauteren Articles by Diederik Verkest Articles by Gjalt de Jong Articles by Bill Lin

	ASCII Text	x
	Steven Vercauteren, Diederik Verkest, Gjalt de Jong, Bill Lin, "Efficient Verification using Generalized Partial Order Analysis," Design, Automation and Test in Europe Conference and Exhibition, pp. 782, Design Automation and Test in Europe (DATE '98), 1998.

	BibTex	x
	@article{ 10.1109/DATE.1998.655947, author = {Steven Vercauteren and Diederik Verkest and Gjalt de Jong and Bill Lin}, title = {Efficient Verification using Generalized Partial Order Analysis}, journal ={Design, Automation and Test in Europe Conference and Exhibition}, volume = {0}, year = {1998}, isbn = {0-8186-8359-7}, pages = {782}, doi = {http://doi.ieeecomputersociety.org/10.1109/DATE.1998.655947}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }

	RefWorks Procite/RefMan/Endnote	x
	TY - CONF JO - Design, Automation and Test in Europe Conference and Exhibition TI - Efficient Verification using Generalized Partial Order Analysis SN - 0-8186-8359-7 SP EP A1 - Steven Vercauteren, A1 - Diederik Verkest, A1 - Gjalt de Jong, A1 - Bill Lin, PY - 1998 KW - Formal Verification KW - Functional Verification KW - High-level Design Validation VL - 0 JA - Design, Automation and Test in Europe Conference and Exhibition ER -

Steven Vercauteren, IMEC

Diederik Verkest, IMEC

Gjalt de Jong, Alcatel Telecom

Bill Lin, University of California, San Diego

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.

Index Terms:

Formal Verification, Functional Verification, High-level Design Validation

Citation:

Steven Vercauteren, Diederik Verkest, Gjalt de Jong, Bill Lin, "Efficient Verification using Generalized Partial Order Analysis," date, pp.782, Design Automation and Test in Europe (DATE '98), 1998

Peer Review Notice | Give Us Feedback

Usage of this product signifies your acceptance of the Terms of Use.