This paper presents a local algorithm for solving the universal parametric real-time model-checking problem. The problem may be phrased as follows: given a real-time system and temporal formula, both of which may contain parameters, and a constraint over the parameters, does every allowed parameter assignment ensure that the real-time system satisfies the formula? Our approach relies on translating these model-checking problems into predicate equation systems, and then using an efficient proof-search algorithm to solve these systems. Experimental data shows that our method substantially outperforms existing approaches for systems that contain errors, while exhibiting comparable behavior for systems that are correct. This fast errordetection capability of our technique makes it especially interesting for design approaches in which model checkers are used "early and often" to detect design errors in an ongoing manner. Proceedings of the 26th IEEE International Real-Time Systems Symposium (RTSS'05) 0-7695-2490-7/05 $20.00 © 2005 IEEE Proceedings of the 26th IEEE International Real-Time Systems Symposium (RTSS'05) 0-7695-2490-7/05 $20.00 © 2005 IEEE Proceedings of the 26th IEEE International Real-Time Systems Symposium (RTSS'05) 0-7695-2490-7/05 $20.00 © 2005 IEEE Proceedings of the 26th IEEE International Real-Time Systems Symposium (RTSS'05) 0-7695-2490-7/05 $20.00 © 2005 IEEE Proceedings of the 26th IEEE International Real-Time Systems Symposium (RTSS'05) 0-7695-2490-7/05 $20.00 © 2005 IEEE
In REF , the authors introduce an algorithm for solving the parametric real-time model-checking problem: given a real-time system and temporal formula, both of which may contain parameters, and a constraint over the parameters, does every allowed parameter assignment ensure that the real-time system satisfies the formula?
Fast on-the-fly parametric real-time model checking
26th IEEE International Real-Time Systems Symposium (RTSS'05)
26th IEEE International Real-Time Systems Symposium (RTSS'05)
Computer Science