Filters








4 Hits in 3.8 sec

On Lexicographic Proof Rules for Probabilistic Termination [article]

Krishnendu Chatterjee, Ehsan Kafshdar Goharshady, Petr Novotný, Jiří Zárevúcky, Đorđe Žikelić
2021 arXiv   pre-print
This standard feature of non-probabilistic termination proofs was hitherto not known to be sound in the probabilistic setting, as the soundness proof requires a careful analysis of the underlying stochastic  ...  Lexicographic ranking functions provide a sound and practical approach for termination of non-probabilistic programs, and their extension to probabilistic programs is achieved via lexicographic ranking  ...  Tools and Al- gorithms for the Construction and Analysis of Systems: 22nd International Conference, TACAS 2016, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS  ... 
arXiv:2108.02188v1 fatcat:5xnql7jo6bcatbw2t3stsics5q

Learning-Based Mean-Payoff Optimization in an Unknown MDP under Omega-Regular Constraints [article]

Jan Křetínský, Guillermo A. Pérez, Jean-François Raskin
2018 arXiv   pre-print
of guarantees on the parity and mean-payoff objectives can be achieved depending on how much memory one is willing to use.  ...  (i) For all $\epsilon$ and $\gamma$ we can construct an online-learning finite-memory strategy that almost-surely satisfies the parity objective and which achieves an $\epsilon$-optimal mean payoff with  ...  In Tools and Algorithms for the Construction and Analysis of Systems -22nd International Conference, TACAS 2016, Held as Part of the European Joint Conferences on Theory and Practice of Soft-Przemyslaw  ... 
arXiv:1804.08924v4 fatcat:wdz4hyx7obhxdcep2bbxd2dx6a

On the Monitorability of Session Types, in Theory and Practice [article]

Christian Batrolo Burlò, Adrian Francalanza, Alceste Scalas
2021 arXiv   pre-print
This work takes a fresh look at the run-time verification of communicating systems using session types, in theory and in practice.  ...  On the practical side, we show that our monitoring theory is indeed realisable: building upon our formal model, we develop a Scala toolkit for the automatic generation of session monitors.  ...  ., 46(3):197-225, 2015. doi:10.1007/ s10703-014-0218-8. 17 International Conference, FOSSACS 2016, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2016, Eindhoven  ... 
arXiv:2105.06291v1 fatcat:wpy4l4tf3rhqhhqgyzbohtrcbu

Continuous Reachability for Unordered Data Petri nets is in PTime [article]

Utkarsh Gupta, Preey Shah, S. Akshay, Piotr Hofman
2019 arXiv   pre-print
On the other hand, the problem of reachability for UDPN is surprisingly complex, and its decidability status remains open.  ...  Our main result is a characterization of continuous reachability for UDPN and polynomial time algorithm for solving it.  ...  In Tools and Algorithms for the Construc- tion and Analysis of Systems -22nd International Conference, TACAS 2016, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS  ... 
arXiv:1902.05604v1 fatcat:36lrixgenvgytdj7trlav4enlm