A new notion, covering, generalising independence is introduced. It enables improved effects of partial-order reduction techniques when applied to real-time systems. Furthermore, we formulate a number of locally checkable conditions for covering that can be used as the basis for a practical algorithm. Correctness is proven with respect to a chosen discretisation method.
This is a preview of subscription content, log in to check access.
Buy single article
Instant access to the full article PDF.
Price includes VAT for USA
Subscribe to journal
Immediate online access to all issues from 2019. Subscription will auto renew annually.
This is the net price. Taxes to be calculated in checkout.
Received March 1998 / Accepted in revised form October 1998
About this article
Cite this article
Dams, D., Gerth, R., Knaack, B. et al. Partial-order Reduction Techniques for Real-time Model Checking. Form Aspects Comput 10, 469–482 (1998). https://doi.org/10.1007/s001650050028
- Keywords: Verification; Model checking; Partial-order reduction; Real time; Covering