2006
Experimental Comparison of Algorithms Checking Proviso for Partial Order Reduction
MORAVEC, PavelBasic information
Original name
Experimental Comparison of Algorithms Checking Proviso for Partial Order Reduction
Name in Czech
Experimentální porovnání algoritmů ověřujících proviso pro redukci pomocí reprezentantů
Authors
MORAVEC, Pavel (203 Czech Republic, guarantor)
Edition
Mikulov, Czech Republic, 2nd Doctoral Workshop on Mathematical and Engineering Methods in Computer Science (MEMICS 2006), p. 129-136, 2006
Publisher
FI MU Report Series
Other information
Language
English
Type of outcome
Proceedings paper
Field of Study
10201 Computer sciences, information science, bioinformatics
Country of publisher
Czech Republic
Confidentiality degree
is not subject to a state or trade secret
RIV identification code
RIV/00216224:14330/06:00015445
Organization unit
Faculty of Informatics
Keywords in English
model checking; partial order reduction; proviso checking
Changed: 4/12/2006 15:24, Mgr. Pavel Moravec
In the original language
In this paper we have summed up all known algorithms checking proviso for partial order reduction in LTL model checking. All mentioned algorithms have been implemented and experimentally evaluated on a large collection of models. Experiments mostly confirmed theoretical expectations of algorithms comparison.
In Czech
Článek shrnuje všechny známé algoritmy pro ověřování provisa u redukce pomocí reprezentantů pro ověřování LTL vlastností modelu. Všechny zmíněné algoritmy byly implementovány a experimentálně vyhodnoceny na rozsáhlé sbírce modelů. Experimenty ve většině případů potvrdily teoretická očekávání z porovnání algoritmů.
Links
GA201/06/1338, research and development project |
| ||
GD102/05/H050, research and development project |
| ||
MSM0021622419, plan (intention) |
| ||
1ET408050503, research and development project |
| ||
1M0545, research and development project |
|