Zobrazeno 1 - 10
of 48
pro vyhledávání: '"Andrea Turrini"'
Autor:
Andrea Turrini
Publikováno v:
Applied Sciences, Vol 12, Iss 4, p 2016 (2022)
Model checking is a well-established and widely adopted framework used to verify whether a given system satisfies the desired properties. Properties are usually given by means of formulas from a specific logic; there are several logics that can be us
Externí odkaz:
https://doaj.org/article/fa57fb0c7d82482cb44d839b63880c17
Autor:
Andrea Turrini, Holger Hermanns
Publikováno v:
Logical Methods in Computer Science, Vol Volume 10, Issue 4 (2014)
Probabilistic automata constitute a versatile and elegant model for concurrent probabilistic systems. They are equipped with a compositional theory supporting abstraction, enabled by weak probabilistic bisimulation serving as the reference notion for
Externí odkaz:
https://doaj.org/article/d04b8b714b1f44d2af57b35ac55de34f
Publikováno v:
Theoretical Computer Science. 935:1-20
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::41af8ee07c228c8fefd1088b723c6aab
https://doi.org/10.1016/j.tcs.2022.07.002
https://doi.org/10.1016/j.tcs.2022.07.002
Publikováno v:
IEEE transactions on software engineering, 48(5), 1545-1559. IEEE
The classical planning problem aims to find a sequence of permitted actions leading a system to a designed state, i.e., to achieve the system's task. However, in many realistic cases we also have requirements on how to complete the task, indicating t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b44d4e0619bfc262ef8cff8f2c74d17d
https://doi.org/10.1109/tse.2020.3024215
https://doi.org/10.1109/tse.2020.3024215
Publikováno v:
Tsinghua Science and Technology. 27:372-385
Mu-calculus (a.k.a. μTL) is built up from modal/dynamic logic via adding the least fixpoint operator μ. This type of logic has attracted increasing attention since Kozen's seminal work. PμTL is a succinct probabilistic extension of the standard μ
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::2da121b8da36683b434c7ff0a8907806
https://doi.org/10.26599/tst.2020.9010054
https://doi.org/10.26599/tst.2020.9010054
Publikováno v:
Tools and Algorithms for the Construction and Analysis of Systems ISBN: 9783031308222
Complementation of nondeterministic Büchi automata (BAs) is an important problem in automata theory with numerous applications in formal verification, such as termination analysis of programs, model checking, or in decision procedures of some logics
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::52f77a076d4e5e1ec5a03d77d0e87b27
https://doi.org/10.1007/978-3-031-30823-9_13
https://doi.org/10.1007/978-3-031-30823-9_13
Publikováno v:
Journal of Systems and Software. 201:111673
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::cbe1283d5d59abc6dce350d6a2283d94
https://doi.org/10.1016/j.jss.2023.111673
https://doi.org/10.1016/j.jss.2023.111673
Publikováno v:
Computer Aided Verification ISBN: 9783031131875
The determinization of a nondeterministic Büchi automaton (NBA) is a fundamental construction of automata theory, with applications to probabilistic verification and reactive synthesis. The standard determinization constructions, such as the ones ba
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5e7770f5c37c5f4e41b6d6cd4a7f2064
https://doi.org/10.1007/978-3-031-13188-2_8
https://doi.org/10.1007/978-3-031-13188-2_8
Publikováno v:
IJCAI
We consider the problem of synthesizing good-enough (GE)-strategies for linear temporal logic (LTL) over finite traces or LTLf for short. The problem of synthesizing GE-strategies for an LTL formula φ over infinite traces reduces to the problem of s
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f2bc277e237a3ad0f16660ea6c8e2316
https://doi.org/10.24963/ijcai.2021/570
https://doi.org/10.24963/ijcai.2021/570