Parametric Model Checking Continuous-Time Markov Chains

Catalin-Andrei Ilie, James Ben Worrell, Martin Theobald, Ana Ozaki, Emilio Muñoz-Velasco
2020 International Symposium/Workshop on Temporal Representation and Reasoning  
CSL is a well-known temporal logic for specifying properties of real-time stochastic systems, such as continuous-time Markov chains. We introduce PCSL, an extension of CSL that allows using existentially quantified parameters in timing constraints, and investigate its expressiveness and decidability over properties of continuous-time Markov chains. Assuming Schanuel's Conjecture, we prove the decidability of model checking the one-parameter fragment of PCSL on continuous-time Markov chains.
more » ... nically, the central problem we solve (relying on Schanuel's Conjecture) is to decide positivity of real-valued exponential polynomial functions on bounded intervals. A second contribution is to give a reduction of the Positivity Problem for matrix exponentials to the PCSL model checking problem, suggesting that it will be difficult to give an unconditional proof of the decidability of model checking PCSL.
doi:10.4230/lipics.time.2020.7 dblp:conf/time/IlieW20 fatcat:srnjorcsqzgila53crnjxfp5tm