Graph-Based Algorithms for Boolean Function Manipulation
IEEE Transactions on Computers
Shared binary decision diagram with attributed edges for efficient Boolean function manipulation
DAC '90 Proceedings of the 27th ACM/IEEE Design Automation Conference
Parametric real-time reasoning
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
The algorithmic analysis of hybrid systems
Theoretical Computer Science - Special issue on hybrid systems
Symbolic approximations for verifying real-time systems
Symbolic approximations for verifying real-time systems
Region Encoding Diagram for Fully Symbolic Verification of Real-Time Systems
COMPSAC '00 24th International Computer Software and Applications Conference
Symbolic Verification of Complex Real-Time Systems with Clock-Restriction Diagram
FORTE '01 Proceedings of the IFIP TC6/WG6.1 - 21st International Conference on Formal Techniques for Networked and Distributed Systems
Automata For Modeling Real-Time Systems
ICALP '90 Proceedings of the 17th International Colloquium on Automata, Languages and Programming
Efficient Verification of Timed Automata with BDD-Like Data-Structures
VMCAI 2003 Proceedings of the 4th International Conference on Verification, Model Checking, and Abstract Interpretation
Symbolic Model Checking for Distributed Real-Time Systems
FME '93 Proceedings of the First International Symposium of Formal Methods Europe on Industrial-Strength Formal Methods
Symbolic Techniques for Parametric Reasoning about Counter and Clock Systems
CAV '00 Proceedings of the 12th International Conference on Computer Aided Verification
Data-Structures for the Verification of Timed Automata
HART '97 Proceedings of the International Workshop on Hybrid and Real-Time Systems
RTSS '95 Proceedings of the 16th IEEE Real-Time Systems Symposium
Approximate reachability analysis of timed automata
RTSS '96 Proceedings of the 17th IEEE Real-Time Systems Symposium
TCTL inevitability analysis of dense-time systems
CIAA'03 Proceedings of the 8th international conference on Implementation and application of automata
Towards Deriving Test Sequences by Model Checking
Electronic Notes in Theoretical Computer Science (ENTCS)
Test Plan Generation for Concurrent Real-Time Systems Based on Zone Coverage Analysis
TestCom '08 / FATES '08 Proceedings of the 20th IFIP TC 6/WG 6.1 international conference on Testing of Software and Communicating Systems: 8th International Workshop
Event order abstraction for parametric real-time system verification
EMSOFT '08 Proceedings of the 8th ACM international conference on Embedded software
Time-Progress Evaluation for Dense-Time Automata with Concave Path Conditions
ATVA '08 Proceedings of the 6th International Symposium on Automated Technology for Verification and Analysis
SMT '08/BPR '08 Proceedings of the Joint Workshops of the 6th International Workshop on Satisfiability Modulo Theories and 1st International Workshop on Bit-Precise Reasoning
TACAS '09 Proceedings of the 15th International Conference on Tools and Algorithms for the Construction and Analysis of Systems: Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009,
Symbolic Branching Bisimulation-Checking of Dense-Time Systems in an Environment
HSCC '09 Proceedings of the 12th International Conference on Hybrid Systems: Computation and Control
Machine-Assisted Parameter Synthesis of the Biphase Mark Protocol Using Event Order Abstraction
FORMATS '09 Proceedings of the 7th International Conference on Formal Modeling and Analysis of Timed Systems
IMITATOR: A Tool for Synthesizing Constraints on Timing Bounds of Timed Automata
ICTAC '09 Proceedings of the 6th International Colloquium on Theoretical Aspects of Computing
Model checking genetic regulatory networks with parameter uncertainty
HSCC'07 Proceedings of the 10th international conference on Hybrid systems: computation and control
ATVA'07 Proceedings of the 5th international conference on Automated technology for verification and analysis
Symbolic simulation-checking of dense-time automata
FORMATS'07 Proceedings of the 5th international conference on Formal modeling and analysis of timed systems
Proceedings of the 14th international conference on Hybrid systems: computation and control
Efficient scenario verification for hybrid automata
CAV'11 Proceedings of the 23rd international conference on Computer aided verification
Proving and explaining the unfeasibility of message sequence charts for hybrid systems
Proceedings of the International Conference on Formal Methods in Computer-Aided Design
Model checking of hybrid systems using shallow synchronization
FMOODS'10/FORTE'10 Proceedings of the 12th IFIP WG 6.1 international conference and 30th IFIP WG 6.1 international conference on Formal Techniques for Distributed Systems
Hierarchical reasoning for the verification of parametric systems
IJCAR'10 Proceedings of the 5th international conference on Automated Reasoning
Exact and fully symbolic verification of linear hybrid automata with large discrete state spaces
Science of Computer Programming
Efficient model-checking of dense-time systems with time-convexity analysis
Theoretical Computer Science
SMT-based scenario verification for hybrid systems
Formal Methods in System Design
ABCD-L: approximating continuous linear systems using boolean models
Proceedings of the 50th Annual Design Automation Conference
Hierarchical reasoning and model generation for the verification of parametric hybrid systems
CADE'13 Proceedings of the 24th international conference on Automated Deduction
| Hi-index | 0.00 |
We introduce a new BDD-like data structure called Hybrid-Restriction Diagrams (HRDs) for the representation and manipulation of linear hybrid automata (LHA) state-spaces and present algorithms for weakest precondition calculations. This permits us to reason about the valuations of parameters that make safety properties satisfied. Advantages of our approach include the ability to represent discrete state information and concave polyhedra in a unified scheme, as well as to save both memory consumptions and manipulation times when processing the same substructures in state-space representations. Our experimental results document its efficiency in practice.