Incremental Verification of Timing Constraints for Real-Time Systems
Testing constraints for real-time systems are usually verified through the satisfiability of propositional formulae. In this paper, we propose an alternative where the verification of timing constraints can be done by counting the number of truth assignments instead of boolean satisfiability. This n...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
2004
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/1721.1/7421 |