J-F. Groote and S. M. F. van Vlijmen. A modal logic for CRL. Technical Report 114, Logic Group Preprint Series, Department of Philosophy, Utrecht University, 1994.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....more efficient evaluation of temporal formulas by means of specialized algorithms dedicated to calculus model checking. Several temporal logics have already been implemented as libraries of Xtl operators: Ctl [4] Actl [24] Ltac [26] as well as a branching time fragment of the Crl modal logic [16], which allows to handle data values. 2 Test Generation based on Verification 3 eXecutable Temporal Language ffl The development of a prototype compiler and verification tool for an implementable subset of E Lotos has been undertaken by Mihaela Sighireanu, as part of her PhD thesis, and by ....

J-F. Groote and S. M. F. van Vlijmen. A modal logic for CRL. Technical Report 114, Logic Group Preprint Series, Department of Philosophy, Utrecht University, 1994.

....whether a train present on track 69B has just past point 69 or is travelling towards point 69. A solution to this problem may well be to use modal logic. It seems that safety criteria such as the one in Example 7. 1 can be expressed quite easily by means of modal logic, such as described in [5]. ....

J.F. Groote and S.F.M. van Vlijmen. A modal logic for ¯CRL. Logic Group Preprint Series 114, Utrecht University, 1994.

....whether a train present on track 69B has just past point 69 or is travelling towards point 69. A solution to this problem may well be to use modal logic. It seems that safety criteria such as the one in Example 7. 1 can be expressed quite easily by means of modal logic, such as described in [5]. ....

J.F. Groote and S.F.M. van Vlijmen. A modal logic for ¯CRL. Logic Group Preprint Series 114, Utrecht University, 1994.

....whether a train present on track 69B has just past point 69 or is travelling towards point 69. A solution to this problem may well be to use modal logic. It seems that safety criteria such as the one in Example 7. 1 can be expressed quite easily by means of modal logic, such as described in [5]. ....

J.F. Groote and S.F.M. van Vlijmen. A modal logic for ¯CRL. Logic Group Preprint Series 114, Utrecht University, 1994.

....but less precise notation for terms in Valuation. The same notation is used to shorten the arguments of the actions that figure as the labels; read( 1 ) means read(add(I ; int(S(0nat) 0nat) emptyvaluation) etc. 2 To express properties of transition systems, modal logics are very useful. In [25] a modal logic for CRL is proposed. There are various means to verify properties expressed in a modal logic on a transition system. Some of them are very systematical and other more ad hoc. In Section 4.1 is investigated to some extent what properties might be candidates for verification. Also ....

....of correctness criteria we have got the impression that correctness criteria will have the following structure: After a send(v) action, if OE(v) holds, then in the near future holds and in the recent past held . Before we can formalise these criteria in the modal logic of CRL as defined in [25], a set of formulas is presented called the local propositions. These are formulas expressing properties of elements in Valuation. In the definition just below, two notions are used that are taken form [25] V is used to denote a set of typed variables, MF Sig;V is the set of modal formulas given ....

[Article contains additional citation context not shown here]

J.F. Groote and S.F.M. van Vlijmen. A modal logic for ¯CRL. Technical Report 114, Logic Group Preprint Series, Utrecht University, 1994.

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