Zobrazeno 1 - 10
of 39
pro vyhledávání: '"Theory of computation → Verification by model checking"'
Autor:
Nina, Maria Paula Parga, An, Haozhe, Gurumukhani, Mohit, Impagliazzo, Russell, Jaber, Michael, Künnemann, Marvin, Parga Nina, Maria Paula
Publikováno v:
16th International Symposium on Parameterized and Exact Computation
Leibniz International Proceedings in Informatics
Leibniz International Proceedings in Informatics (LIPIcs), 214
16th International Symposium on Parameterized and Exact Computation (IPEC 2021)
Leibniz International Proceedings in Informatics
Leibniz International Proceedings in Informatics (LIPIcs), 214
16th International Symposium on Parameterized and Exact Computation (IPEC 2021)
We define a class of problems whose input is an n-sized set of d-dimensional vectors, and where the problem is first-order definable using comparisons between coordinates. This class captures a wide variety of tasks, such as complex types of orthogon
Autor:
Esparza, Javier, Grande, Vincent P.
We study black-box testing for stochastic systems and arbitrary ω-regular specifications, explicitly including liveness properties. We are given a finite-state probabilistic system that we can only execute from the initial state. We have no informat
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::227216214fbda42bf70c8a3f13fca283
http://arxiv.org/abs/2303.03292
http://arxiv.org/abs/2303.03292
In the process of designing a computer system S and checking whether an abstract model ℳ of S verifies a given specification property η, one might have only a partial knowledge of the model, either because ℳ has not yet been completely defined (
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e3bc73fed69b1f27587f542a1d534ade
This report documents the program and the outcomes of Dagstuhl Seminar 22492 "Formal Methods and Distributed Computing: Stronger Together", held in December 2022.
DagRep, Volume 12, Issue 12, pages 27-53
DagRep, Volume 12, Issue 12, pages 27-53
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::62f7283b114ba050238e413c30e950e3
In embedded systems, applications frequently have to meet non-functional requirements regarding, e.g., real-time or energy consumption constraints, when executing on a given MPSoC target platform. Feedback-based controllers have been proposed that re
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::029c7de60a7c7e2efa6a38000b55c94d
Publikováno v:
ICALP 2022-49th International Colloquium on Automata, Languages, and Programming
ICALP 2022-49th International Colloquium on Automata, Languages, and Programming, Jul 2022, Paris / Hybrid, France. pp.1-19
ICALP 2022-49th International Colloquium on Automata, Languages, and Programming, Jul 2022, Paris / Hybrid, France. pp.1-19
The stochastic shortest path problem (SSPP) asks to resolve the non-deterministic choices in a Markov decision process (MDP) such that the expected accumulated weight before reaching a target state is maximized. This paper addresses the optimization
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::2404985b531e3fae97cada0a0397c899
https://hal.science/hal-03776449
https://hal.science/hal-03776449
Decidability of the problems of unboundedness and simultaneous unboundedness (aka. the diagonal problem) for higher-order recursion schemes was established by Clemente, Parys, Salvati, and Walukiewicz (2016). Then a procedure of optimal complexity wa
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::1bc875e37033d02897160f337a4e1d01
Autor:
Bertrand, Nathalie
Distributed computing is increasingly spreading, in advanced technological applications as well as in our daily life. Failures in distributed algorithms can have important human and financial consequences, so that is is crucial to develop rigorous te
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4bf3c6dc3629ed5145abfe139cc985a3
Embedded system applications usually have to meet real-time, energy or safety requirements on programs typically concurrently executed on a given MPSoC target platform. Enforcing such properties, e.g., by adapting the number of processors allocated t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::29fdb2ed6721b2198c2b846f9c6c3645
Autor:
Casares, Antonio, Ohlmann, Pierre
This paper is concerned with games of infinite duration played over potentially infinite graphs. Recently, Ohlmann (LICS 2022) presented a characterisation of objectives admitting optimal positional strategies, by means of universal graphs: an object
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::8a61dade147375041f47515b9ee586db