Abstract
In this thesis we tackle the difficulty of translating a high level formalism to Decision Diagrams (DDs). We propose to improve an existing DD (the ΣDD) and its operations to better handle new operations. Our solution adds an abstraction layer on top of ΣDDs. This abstraction layer can express the usual operations of DDs in a high level way. It allows the definition of the semantics of a system, the description of the model checking algorithm, and DD optimizations. Our layer is called Set Rewriting (SR). SR is an extension of classical Term Rewriting (TR). In SR we describe a system using terms and term rewriting rules as in TR. However, the rewrite rules of SR are designed to work on sets of terms instead of single terms. SR also uses TR strategies. TR strategies are operations to control the rewriting process. They enable a better control of rewrite process.
Sign-in/Register to access full text options 
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 callDisclaimer: 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.
