Další formáty:
BibTeX
LaTeX
RIS
@inproceedings{1492177,
author = {Boenneland, F.M. and Dyhr, J. and Jensen, P.G. and Johannsen, M. and Srba, Jiří},
address = {Holland},
booktitle = {Proceedings of the 39th International Conference on Application and Theory of Petri Nets and Concurrency (Petri Nets'18)},
doi = {http://dx.doi.org/10.1007/978-3-319-91268-4_8},
keywords = {CTL model checking; Petri nets; on-the-fly algorithms},
howpublished = {tištěná verze "print"},
language = {eng},
location = {Holland},
isbn = {978-3-319-91267-7},
pages = {143-163},
publisher = {Springer-Verlag},
title = {Simplification of CTL Formulae for Efficient Model Checking of Petri Nets},
url = {https://link.springer.com/chapter/10.1007/978-3-319-91268-4_8},
year = {2018}
}
TY - JOUR
ID - 1492177
AU - Boenneland, F.M. - Dyhr, J. - Jensen, P.G. - Johannsen, M. - Srba, Jiří
PY - 2018
TI - Simplification of CTL Formulae for Efficient Model Checking of Petri Nets
PB - Springer-Verlag
CY - Holland
SN - 9783319912677
KW - CTL model checking
KW - Petri nets
KW - on-the-fly algorithms
UR - https://link.springer.com/chapter/10.1007/978-3-319-91268-4_8
L2 - https://link.springer.com/chapter/10.1007/978-3-319-91268-4_8
N2 - We study techniques to overcome the state space explosion problem in CTL model checking of Petri nets. Classical state space pruning approaches like partial order reductions and structural reductions become less efficient with the growing size of the CTL formula. The reason is that the more places and transitions are used as atomic propositions in a given formula, the more of the behaviour (interleaving) becomes relevant for the validity of the formula. We suggest several methods to reduce the size of CTL formulae, while preserving their validity. By these methods, we significantly increase the benefits of structural and partial order reductions, as the combination of our techniques can achive up to 60 percent average reduction in formulae sizes. The algorithms are implemented in the open-source verification tool TAPAAL and we document the efficiency of our approach on a large benchmark of Petri net models and queries from the Model Checking Contest 2017.
ER -
BOENNELAND, F.M., J. DYHR, P.G. JENSEN, M. JOHANNSEN a Jiří SRBA. Simplification of CTL Formulae for Efficient Model Checking of Petri Nets. In \textit{Proceedings of the 39th International Conference on Application and Theory of Petri Nets and Concurrency (Petri Nets'18)}. Holland: Springer-Verlag, 2018, s.~143-163. ISBN~978-3-319-91267-7. Dostupné z: https://dx.doi.org/10.1007/978-3-319-91268-4\_{}8.
|
