Other formats:
BibTeX
LaTeX
RIS
@inproceedings{583903,
author = {Moravec, Pavel},
address = {Znojmo, Czech Republic},
booktitle = {1st Doctoral Workshop on Mathematical and Engineering Methods in Computer Science (MEMICS 2005)},
keywords = {model checking; partial order reduction; ample sets},
language = {eng},
location = {Znojmo, Czech Republic},
pages = {186-192},
publisher = {FI MU Report Series},
title = {How to Cope with Higher Dependency in Partial Order Reduction for LTL Model Checking},
url = {http://www.fi.muni.cz/memics05/},
year = {2005}
}
TY - JOUR
ID - 583903
AU - Moravec, Pavel
PY - 2005
TI - How to Cope with Higher Dependency in Partial Order Reduction for LTL Model Checking
PB - FI MU Report Series
CY - Znojmo, Czech Republic
KW - model checking
KW - partial order reduction
KW - ample sets
UR - http://www.fi.muni.cz/memics05/
N2 - Partial order reduction tries to combat the state space explosion problem by reducing the size of the state space. It is based on exploring only a subset of all possible interleavings of independent concurrent processes. However, even in cases when the dependency among processes is small, the method often fails. The reason is that the heuristics actually used to compute the dependency relation are too rough. In this paper we propose a new method which often overcomes the described bottleneck of partial order reduction.
ER -
MORAVEC, Pavel. How to Cope with Higher Dependency in Partial Order Reduction for LTL Model Checking. In \textit{1st Doctoral Workshop on Mathematical and Engineering Methods in Computer Science (MEMICS 2005)}. Znojmo, Czech Republic: FI MU Report Series, 2005, p.~186-192.
|
