Abstract
Tools for modeling and verification of discrete event systems are implemented in Mathematica. The tools are based on binary decision diagrams (BDD) for which a Mathematica interface is provided. For modeling a compiler is developed translating a restricted class of Pascal into boolean expressions represented by BDDs. The tools are used in an application of a landing gear system of a fighter aircraft. This system is controlled by a software consisting of 1200 lines of Pascal. This code represented as a BDD is then analyzed using temporal logics. This article demonstrates the principle of the Pascal compiler.
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.
