Revisiting Resistance Speeds Up I/O Efficient LTL Model Checking
| BARNAT, Jiří, Luboš BRIM, Pavel ŠIMEČEK and Michael WEBER. Revisiting Resistance Speeds Up I/O Efficient LTL Model Checking. In Tools and Algorithms for the Construction and Analysis of Systems. Berlin, Heidelberg: Springer-Verlag, 2008, p. 48-62. ISBN 978-3-540-78799-0. |
|
Other formats:
BibTeX
LaTeX
RIS
|
| Basic information | |
|---|---|
| Original name | Revisiting Resistance Speeds Up I/O Efficient LTL Model Checking |
| Name in Czech | Odolnost vůči znovu-navštívení zrychluje I/O efektivní ověřování modelu |
| Authors | BARNAT, Jiří (203 Czech Republic, guarantor), Luboš BRIM (203 Czech Republic), Pavel ŠIMEČEK (203 Czech Republic) and Michael WEBER (528 Netherlands). |
| Edition | Berlin, Heidelberg, Tools and Algorithms for the Construction and Analysis of Systems, p. 48-62, 15 pp. 2008. |
| Publisher | Springer-Verlag |
| Other information | |
|---|---|
| Original language | English |
| Type of outcome | Proceedings paper |
| Field of Study | 10201 Computer sciences, information science, bioinformatics |
| Country of publisher | Germany |
| Confidentiality degree | is not subject to a state or trade secret |
| Impact factor | Impact factor: 0.402 in 2005 |
| RIV identification code | RIV/00216224:14330/08:00024177 |
| Organization unit | Faculty of Informatics |
| ISBN | 978-3-540-78799-0 |
| ISSN | 0302-9743 |
| UT WoS | 000254735100005 |
| Keywords in English | I/O efficient; accepting cycle detection; revisiting resistance |
| Tags | accepting cycle detection, I/O efficient, revisiting resistance |
| Tags | International impact, Reviewed |
| Changed by | Changed by: prof. RNDr. Jiří Barnat, Ph.D., učo 3496. Changed: 30/3/2010 09:16. |
| Abstract |
|---|
| Revisiting resistance graph algorithms are those, whose correctness is not vulnerable to repeated edge exploration. Revisiting resistant I/O efficient graph algorithms exhibit considerable speed-up in practice in comparison to non-revisiting resistant algorithms. In the paper we present a new revisiting resistant I/O efficient LTL model checking algorithm. We analyze its theoretical I/O complexity and we experimentally compare its performance to already existing I/O efficient LTL model checking algorithms. |
| Abstract (in Czech) |
|---|
| Korektnost některý grafových algoritmů je nezávislá od počtu vykonání, potažmo opakování, akcí spojených s průzkumem jedné hrany grafu. Takové algoritmy nazýváme RR-algorimty. V článku je ukázáno, že této vlastnosti algoritmů lze využít pro výrazné zrychlení výpočtu algoritmu v kontextu algoritmů používajících při výpočtu externí paměť (tj. disk). |
| Links | |
|---|---|
| GA201/06/1338, research and development project | Name: Automatizovaná verifikace softwaru |
| Investor: Czech Science Foundation, Automated software verification | |
| 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 | |
| 1ET400300504, research and development project | Name: Realistická aplikace formálních metod v komponentových systémech |
| Investor: Academy of Sciences of the Czech Republic, Realistic application of formal methods in component systems | |
| 1ET408050503, research and development project | Name: Techniky automatické verifikace a validace softwarových a hardwarových systémů |
| Investor: Academy of Sciences of the Czech Republic, Techniques for automatic verification and validation of software nad hardware systems | |
| 1M0545, research and development project | Name: Institut Teoretické Informatiky |
| Investor: Ministry of Education, Youth and Sports of the CR, Institute for Theoretical Computer Science | |
PrintDisplayed: 8/8/2024 23:59