"The Satisfiability Problem for Unbounded Fragments of Probabilistic CTL."

Jan Kretínský, Alexej Rotar (2018)

Details and statistics

DOI: 10.4230/LIPICS.CONCUR.2018.32

access: open

type: Conference or Workshop Paper

metadata version: 2019-05-02

a service of  Schloss Dagstuhl - Leibniz Center for Informatics