Abstract
This paper discusses model checking of real-time systems. A novel aspect of our approach is the unconventional approach to representing symbolic state spaces. The representation does not use a canonical form for representing symbolic nodes. Instead it applies an alternative representation based on splitting trees. Unlike common canonical representations, this representation is tailored for the type of exploration algorithm that we apply, namely an algorithm based on partition refinement.
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.
