Další formáty:
BibTeX
LaTeX
RIS
@inproceedings{571233,
author = {Brim, Luboš and Černá, Ivana and Moravec, Pavel and Šimša, Jiří},
address = {Lisboa, Portugal},
booktitle = {Proceedings of the 4th International Workshop on Parallel and Distributed Methods in verifiCation (PDMC 2005)},
keywords = {accepting predecessors; LTL model checking},
language = {eng},
location = {Lisboa, Portugal},
pages = {1-12},
publisher = {TU Munchen},
title = {How to Order Vertices for Distributed LTL Model-Checking Based on Accepting Predecessors},
year = {2005}
}
TY - JOUR
ID - 571233
AU - Brim, Luboš - Černá, Ivana - Moravec, Pavel - Šimša, Jiří
PY - 2005
TI - How to Order Vertices for Distributed LTL Model-Checking Based on Accepting Predecessors
PB - TU Munchen
CY - Lisboa, Portugal
KW - accepting predecessors
KW - LTL model checking
N2 - The distributed automata-based LTL model-checking relies on algorithms for finding accepting cycles in a B\"{u}chi automaton. One approach to distributed accepting cycle detection is based on maximal accepting predecessors. The ordering of accepting states (hence the maximality) is one of the main factors affecting the overall complexity of model-checking as imperfect ordering can enforce numerous re-explorations of the automaton. This paper addresses the problem of finding an optimal ordering, proves its hardness, and gives several heuristics for finding an optimal ordering in the distributed environment. We compare the heuristics both theoretically and experimentally, and find out which of these work well.
ER -
BRIM, Luboš, Ivana ČERNÁ, Pavel MORAVEC a Jiří ŠIMŠA. How to Order Vertices for Distributed LTL Model-Checking Based on Accepting Predecessors. In \textit{Proceedings of the 4th International Workshop on Parallel and Distributed Methods in verifiCation (PDMC 2005)}. Lisboa, Portugal: TU Munchen. s.~1-12. 2005.
|
