The following pages link to (Q4945220):
Displaying 17 items.
- Reachability analysis for timed automata using max-plus algebra (Q444476) (← links)
- A symbolic model for timed concurrent constraint programming (Q530859) (← links)
- The octagon abstract domain (Q853733) (← links)
- On the complexities of selected satisfiability and equivalence queries over Boolean formulas and inclusion queries over hulls (Q1040040) (← links)
- A rewriting approach to binary decision diagrams (Q1349250) (← links)
- Zero, successor and equality in BDDs (Q1772774) (← links)
- Symbolic model checking of timed guarded commands using difference decision diagrams (Q1858438) (← links)
- Formal verification based on Boolean expression diagrams (Q1954165) (← links)
- Bounded model checking for timed automata (Q2842869) (← links)
- Model-Based Verification, Optimization, Synthesis and Performance Evaluation of Real-Time Systems (Q2948229) (← links)
- Binary Decision Diagrams (Q3176365) (← links)
- Model Checking Real-Time Systems (Q3176387) (← links)
- Improvements for the Symbolic Verification of Timed Automata (Q3614852) (← links)
- A Theoretical and Numerical Analysis of the Worst-Case Size of Reduced Ordered Binary Decision Diagrams (Q4617985) (← links)
- An Abstract Domain Extending Difference-Bound Matrices with Disequality Constraints (Q5452614) (← links)
- Efficient Evaluation of Arbitrary Relational Calculus Queries (Q6137874) (← links)
- Abstractions for the local-time semantics of timed automata: a foundation for partial-order methods (Q6649454) (← links)
