A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is
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.doi:10.4230/lipics.time.2020.7 dblp:conf/time/IlieW20 fatcat:srnjorcsqzgila53crnjxfp5tm