Algebraic implementation of CTL model checker

  • Authors:

  • Florentina Laura Cacovean;Emil Marin Popa;Cristina Ioana Brumar;Bogdan Alexandru Brumar

  • Affiliations:

  • Department of Computer Science, Lucian Blaga University of Sibiu, Faculty of Sciences, Sibiu, Romania;Department of Computer Science, Lucian Blaga University of Sibiu, Faculty of Sciences, Sibiu, Romania;Department of Computer Science, Lucian Blaga University of Sibiu, Faculty of Sciences, Sibiu, Romania;Department of Computer Science, Lucian Blaga University of Sibiu, Faculty of Sciences, Sibiu, Romania

  • Venue:
  • MMACTEE'06 Proceedings of the 8th WSEAS international conference on Mathematical methods and computational techniques in electrical engineering
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this work, is presented the methodology and supporting sets of tools, what permitted the possibility automatically generate of the algorithms verify the models for temporal logics from a set of algebraic specifications. This fact is of great deal to the research of suggested aim. The development of temporal logics and the model checking the algorithms can be used to the verification property of system. These are used in to specify model checkers as the mappings of the form MC: Ls → Lt where Ls is a temporal logic source language and Lt is a target language represents sets a state of the model M as MC (f∈Ls) ={s∈M| s|=f}. Is noticed how this algebraic framework can be used to specify of the model checking algorithms for CTL (Computation Tree Logic). The paper [10] is the base of results obtained.