2 citations · 2 across the 3 of their papers we have counts for
Showing cs.LOShow all
2 papers · 1 filter
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…