An application CTL formula based on problem solving methodology

  • Authors:
  • Laura F. Cacovean;Emil M. Popa;Cristina I. Brumar;Iulian Pah

  • 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 Sociology, Babes-Bolyai University Cluj-Napoca, Cluj-Napoca, Romania

  • Venue:
  • ICCOMP'08 Proceedings of the 12th WSEAS international conference on Computers
  • Year:
  • 2008

Quantified Score

Hi-index 0.00

Visualization

Abstract

This paper show a study of case using a new proposes methodology in [6] which it develops approach to solve problem in which domain experts of the problem handle the IT concepts using own natural language but don't and vice-versa. This proposes idea starts as a base for the computation education. In this methodology of computer-solved solution is followed as the problems inside of domain experts of the application domain (AD) they develops algorithms for the solution of the problem using the natural language of their problem domain and informatics technology (IT) experts develops software tools which can execute algorithms developed of AD experts without translation these in programs. We using as example a CTL formula and show how a programming language experts can develop this model without associative programming. We illustrate the use of computational emancipation in language processing with the following problem: (M, s) = ⊨f? where M is a model of a parse system and s is a state of the a model and f is a model CTL formula we want to is satisfied of systems.