Abstract

Proposes an efficient ordering method for solving the state explosion problem in compositional verification of discrete event systems. A system to be verified is specified by untimed DEVS (discrete event system specification) formalism. The size of the intermediate state space during the compositional verification is dependent on the sequence of composing system components. Application of this method to some classical verification problems has shown that the size of the intermediate state space during composition is markedly reduced.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call