VSE knjižnice (vzajemna bibliografsko-kataložna baza podatkov COBIB.SI)
  • ACTLW - an action-based computation tree logic with unless operator
    Meolic, Robert ; Kapus, Tatjana ; Brezočnik, Zmago
    Model checkers for systems represented by labelled transition systems are not as extensively used as those for systems represented by Kripke structures. This is partially due to the lack of an ... elegant formal language for property specification which would not be as raw as, for example, HML yet also not as complex as, for example, -calculus. This paper proposes a new action-based propositional branching-time temporal logic ACTLW, which enhances popular computation tree logic (CTL) with the notion of actions in a similar but more comprehensive way than action-based CTL introduced by De Nicola and Vaandrager [R. De Nicola, F.W. Vaandrager, Action versus logics for transition systems, in: Semantics of Systems of Concurrent Processes, Proceedings LITP Spring School on Theoretical Computer Science, LNCS 469, 1990, pp. 407-419]. ACTLW is defined by using temporal operators until and unless only, whereas all other temporal operators are derived from them. Fixed-point characterisation of the operators together with symbolic algorithms for globalmodel checking are shown. Usage of this new logic is illustrated by an example of verification of mutual-exclusion algorithms.
    Vir: Information sciences. - ISSN 0020-0255 (Vol. 178, iss. 6, 2008, str. 1542-1557)
    Vrsta gradiva - e-članek
    Leto - 2008
    Jezik - angleški
    COBISS.SI-ID - 12047638

    Povezava(-e):

    http://dx.doi.org/10.1016/j.ins.2007.10.023
    Digitalna knjižnica Univerze v Mariboru – DKUM

vir: Information sciences. - ISSN 0020-0255 (Vol. 178, iss. 6, 2008, str. 1542-1557)
loading ...
loading ...
loading ...

Vnos na polico