A Novel Approach to Modechart Verification of Real-Time systems

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216305%3A26230%2F12%3APU98149" target="_blank" >RIV/00216305:26230/12:PU98149 - isvavai.cz</a>

Výsledek na webu

—

DOI - Digital Object Identifier

—

Jazyk výsledku

angličtina

Název v původním jazyce

A Novel Approach to Modechart Verification of Real-Time systems

Popis výsledku v původním jazyce

Because real-time systems are often time-critical applications and their failure can have fatal consequences, it is important to ensure their correct behaviour. There exist many approaches for verification of real-time systems. Some use graphical formalisms, other various kinds of logics, to describe the system being verified. While graphical description can be significantly easier to use, it disallows to utilise many powerful methods for analysis and verification. In this paper, we propose a new approach for verification of real-time systems described by the Modechart graphical formalism by transforming the computation of the system onto a set of restricted real-time logic (RRTL) formulae. Moreover, if the verified property is known in advance, we areable to reduce the number of resulting RRTL formulae.

Název v anglickém jazyce

A Novel Approach to Modechart Verification of Real-Time systems

Popis výsledku anglicky

Because real-time systems are often time-critical applications and their failure can have fatal consequences, it is important to ensure their correct behaviour. There exist many approaches for verification of real-time systems. Some use graphical formalisms, other various kinds of logics, to describe the system being verified. While graphical description can be significantly easier to use, it disallows to utilise many powerful methods for analysis and verification. In this paper, we propose a new approach for verification of real-time systems described by the Modechart graphical formalism by transforming the computation of the system onto a set of restricted real-time logic (RRTL) formulae. Moreover, if the verified property is known in advance, we areable to reduce the number of resulting RRTL formulae.

Druh

J_x - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)

CEP obor

IN - Informatika

OECD FORD obor

—

Projekt

Výsledek vznikl pri realizaci vícero projektů. Více informací v záložce Projekty.

Návaznosti

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>Z - Vyzkumny zamer (s odkazem do CEZ)<br>S - Specificky vyzkum na vysokych skolach

Rok uplatnění

2012

Kód důvěrnosti údajů

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Název periodika

Lecture Notes in Computer Science

ISSN

0302-9743

e-ISSN

—

Svazek periodika

2012

Číslo periodika v rámci svazku

6927

Stát vydavatele periodika

DE - Spolková republika Německo

Počet stran výsledku

8

Strana od-do

559-567

Kód UT WoS článku

—

EID výsledku v databázi Scopus

—