Partial Order Reduction for State/Event LTL with Application to Component-Interaction Automata

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216224%3A14330%2F11%3A00049649" target="_blank" >RIV/00216224:14330/11:00049649 - isvavai.cz</a>

Výsledek na webu

<a href="http://dx.doi.org/10.1016/j.scico.2010.02.008" target="_blank" >http://dx.doi.org/10.1016/j.scico.2010.02.008</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1016/j.scico.2010.02.008" target="_blank" >10.1016/j.scico.2010.02.008</a>

Jazyk výsledku

angličtina

Název v původním jazyce

Partial Order Reduction for State/Event LTL with Application to Component-Interaction Automata

Popis výsledku v původním jazyce

Software systems assembled from autonomous components become an interesting target for formal verification due to the issue of correct interplay in component interaction. State/event LTL (Chaki et al. 2004, 2005) incorporates both states and events to express important properties of component-based software systems. The main contribution of this paper is a partial order reduction technique for verification of state/event LTL properties. The core is a novel notion of stuttering equivalence. The positiveattribute of the equivalence is that it can be resolved with existing methods for partial order reduction. State/event LTL properties are, in general, not preserved under state/event stuttering equivalence. To this end we define a new logic, called weakstate/event LTL, which is invariant under the new equivalence.

Název v anglickém jazyce

Partial Order Reduction for State/Event LTL with Application to Component-Interaction Automata

Popis výsledku anglicky

Software systems assembled from autonomous components become an interesting target for formal verification due to the issue of correct interplay in component interaction. State/event LTL (Chaki et al. 2004, 2005) incorporates both states and events to express important properties of component-based software systems. The main contribution of this paper is a partial order reduction technique for verification of state/event LTL properties. The core is a novel notion of stuttering equivalence. The positiveattribute of the equivalence is that it can be resolved with existing methods for partial order reduction. State/event LTL properties are, in general, not preserved under state/event stuttering equivalence. To this end we define a new logic, called weakstate/event LTL, which is invariant under the new equivalence.

Druh

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

CEP obor

IN - Informatika

OECD FORD obor

—

Projekt

<a href="/cs/project/GA201%2F09%2F1389" target="_blank" >GA201/09/1389: Verifikace a analýza velmi velkých počítačových systémů</a><br>

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í

2011

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

Science of Computer Programming

ISSN

0167-6423

e-ISSN

—

Svazek periodika

76

Číslo periodika v rámci svazku

10

Stát vydavatele periodika

CZ - Česká republika

Počet stran výsledku

14

Strana od-do

877-890

Kód UT WoS článku

000292232900004

EID výsledku v databázi Scopus

—