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

J 2011

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

BENEŠ, Nikola, Luboš BRIM, Barbora BÜHNOVÁ, Ivana ČERNÁ, Jiří SOCHOR et. al.

Basic information

Original name

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

Authors

BENEŠ, Nikola (203 Czech Republic, guarantor, belonging to the institution), Luboš BRIM (203 Czech Republic, belonging to the institution), Barbora BÜHNOVÁ (203 Czech Republic, belonging to the institution), Ivana ČERNÁ (203 Czech Republic, belonging to the institution), Jiří SOCHOR (203 Czech Republic, belonging to the institution) and Pavlína MORAVCOVÁ VAŘEKOVÁ (203 Czech Republic, belonging to the institution)

Edition

Science of Computer Programming, Elsevier, 2011, 0167-6423

Other information

Language

English

Type of outcome

Článek v odborném periodiku

Field of Study

10201 Computer sciences, information science, bioinformatics

Country of publisher

Czech Republic

Confidentiality degree

není předmětem státního či obchodního tajemství

References:

URL

Impact factor

Impact factor: 0.622

RIV identification code

RIV/00216224:14330/11:00049649

Organization unit

Faculty of Informatics

DOI

http://dx.doi.org/10.1016/j.scico.2010.02.008

UT WoS

000292232900004

Keywords in English

State/event LTL; Partial order reduction; Formal verification; Model checking; Component-based systems; Component-interaction automata

Abstract

V originále

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 positive attribute 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 weak state/event LTL, which is invariant under the new equivalence. To bring some evidence of the method’s efficiency, we present the results obtained by employing the partial order reduction technique within our tool for verification of component-based systems.

Links

GA201/09/1389, research and development project

Name: Verifikace a analýza velmi velkých počítačových systémů

Investor: Czech Science Foundation, Verification and Analysis of Large-Scale Computer Systems

MSM0021622419, plan (intention)

Name: Vysoce paralelní a distribuované výpočetní systémy

Investor: Ministry of Education, Youth and Sports of the CR, Highly Parallel and Distributed Computing Systems

MUNI/A/0914/2009, interní kód MU

Name: Rozsáhlé výpočetní systémy: modely, aplikace a verifikace (Acronym: SV-FI MAV)

Investor: Masaryk University, Category A

Files attached

2011-SCP.pdf

Request the author's version of the file

Citovat

BENEŠ, Nikola, Luboš BRIM, Barbora BÜHNOVÁ, Ivana ČERNÁ, Jiří SOCHOR and Pavlína MORAVCOVÁ VAŘEKOVÁ. Partial Order Reduction for State/Event LTL with Application to Component-Interaction Automata. Science of Computer Programming. Elsevier, 2011, vol. 76, No 10, p. 877-890. ISSN 0167-6423. Available from: https://dx.doi.org/10.1016/j.scico.2010.02.008.

@article{905464,
   author = {Beneš, Nikola and Brim, Luboš and Bühnová, Barbora and Černá, Ivana and Sochor, Jiří and Moravcová Vařeková, Pavlína},
   article_number = {10},
   doi = {http://dx.doi.org/10.1016/j.scico.2010.02.008},
   keywords = {State/event LTL; Partial order reduction; Formal verification; Model checking; Component-based systems; Component-interaction automata},
   language = {eng},
   issn = {0167-6423},
   journal = {Science of Computer Programming},
   title = {Partial Order Reduction for State/Event LTL with Application to Component-Interaction Automata},
   url = {http://dx.doi.org/10.1016/j.scico.2010.02.008},
   volume = {76},
   year = {2011}
}

TY  - JOUR
ID  - 905464
AU  - Beneš, Nikola - Brim, Luboš - Bühnová, Barbora - Černá, Ivana - Sochor, Jiří - Moravcová Vařeková, Pavlína
PY  - 2011
TI  - Partial Order Reduction for State/Event LTL with Application to Component-Interaction Automata
JF  - Science of Computer Programming
VL  - 76
IS  - 10
SP  - 877-890
EP  - 877-890
PB  - Elsevier
SN  - 01676423
KW  - State/event LTL
KW  - Partial order reduction
KW  - Formal verification
KW  - Model checking
KW  - Component-based systems
KW  - Component-interaction automata
UR  - http://dx.doi.org/10.1016/j.scico.2010.02.008
N2  - 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 positive attribute 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 weak state/event LTL, which is invariant under the new equivalence. To bring some evidence of the method’s efficiency, we present the results obtained by employing the partial order reduction technique within our tool for verification of component-based systems.
ER  -

BENEŠ, Nikola, Luboš BRIM, Barbora BÜHNOVÁ, Ivana ČERNÁ, Jiří SOCHOR and Pavlína MORAVCOVÁ VAŘEKOVÁ. Partial Order Reduction for State/Event LTL with Application to Component-Interaction Automata. \textit{Science of Computer Programming}. Elsevier, 2011, vol.~76, No~10, p.~877-890. ISSN~0167-6423. Available from: https://dx.doi.org/10.1016/j.scico.2010.02.008.

Detailed Information on Publication Record