| T.A. Henzinger, O. Kupferman, and S.K. Rajamani. Fair simulation. Information and Computation, 173:64--81, 2002. |
.... [18] Another method is to have verification rules for proving safety properties and response properties (see [55] 72] and [71] To extend Temporal and Modal logics ( 34] so that control and test on time and variable values are ensured, many logics have been proposed ( 59] 16] 14] and [17]) These Logics extend the classical temporal operators, such as until or next , with control on time that can be expressed simply with an interval on the temporal operator or better with a quantification, while to check the values of variables, constraints on variables are su#cient. An ....
....control on time that can be expressed simply with an interval on the temporal operator or better with a quantification, while to check the values of variables, constraints on variables are su#cient. An undecidability result holds for these logics if dense time domain is assumed ( 16] 14] and [17]) There are algorithms for simple cases (where decidability holds) which visit the graph of regions, where regions encapsulate infinite evaluations ( 8] 16] and [35] A di#erent way to obtain decidability is to relax punctuality, i.e. it is not permitted to consider singleton intervals (see ....
Alur, R., Henzinger, T.A.: Real-time Logics:Complexity and Expressiveness. Information and Computation 104, 1993, 35--77.
No context found.
T.A. Henzinger, O. Kupferman, and S.K. Rajamani. Fair simulation. Information and Computation, 173:64--81, 2002.
No context found.
T.A. Henzinger, O. Kupferman, and S. Rajamani. Fair simulation. Information and Computation, 173(1):64-81, 2002.
No context found.
T.A. Henzinger, O. Kupferman, and S. Rajamani. Fair simulation. Information and Computation, 173(1):64--81, 2002.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC