2 citations · 2 across the 2 of their papers we have counts for
3 papers
cs.LO2016
Extension of PRISM by Synthesis of Optimal Timeouts in Fixed-Delay CTMC
Ľuboš Korenčiak, Vojtěch Řehák, Adrian Farmadin
We present a practically appealing extension of the probabilistic model checker PRISM rendering it to handle fixed-delay continuous-time Markov chains (fdCTMCs) with rewards, the e…
cs.LO2012
Controllable-choice Message Sequence Graphs
Martin Chmelík, Vojtěch Řehák
We focus on the realizability problem of Message Sequence Graphs (MSG), i.e. the problem whether a given MSG specification is correctly distributable among parallel components comm…
cs.FL2009★ 2 cited
Almost Linear Büchi Automata
Tomáš Babiak, Vojtěch Řehák, Jan Strejček
We introduce a new fragment of Linear temporal logic (LTL) called LIO and a new class of Buechi automata (BA) called Almost linear Buechi automata (ALBA). We provide effective tran…