Abstract
We consider the issue of exploiting the structural form of ESTEREL programs (Berry and Gonthier, 1992) to partition the algorithmic Reachable State Space construction used in model-checking techniques (Clarke et al., 1999). The basic idea sounds utterly simple: in P; Q, first compute entirely the states reached in P and then carry on to Q, each time using only the relevant transition relation part. Difficulties appear in presence of parallelism: program blocks can be synchronised in various ways, which may lead to an excessive complexity in decomposition. We use the structural division as obtained from the programs syntax, some of the key 'cofactoring' features of the TiGeR BDD library (Coudert et al., 1993) and heuristic orderings between internal signals.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.