On finite-state approximants for probabilistic computation tree logic
Theoretical Computer Science - Quantitative aspects of programming languages (QAPL 2004)
Bisimulation and cocongruence for probabilistic systems
Information and Computation - Special issue: Seventh workshop on coalgebraic methods in computer science 2004
A Demonic Approach to Information in Probabilistic Systems
CONCUR 2009 Proceedings of the 20th International Conference on Concurrency Theory
Electronic Notes in Theoretical Computer Science (ENTCS)
Labelled Markov Processes: Stronger and Faster Approximations
Electronic Notes in Theoretical Computer Science (ENTCS)
Bisimulation and cocongruence for probabilistic systems
Information and Computation - Special issue: Seventh workshop on coalgebraic methods in computer science 2004
A logical duality for underspecified probabilistic systems
Information and Computation
Approximating Markov Processes by Averaging
Journal of the ACM (JACM)
Electronic Notes in Theoretical Computer Science (ENTCS)
| Hi-index | 0.00 |
This paper proposes a measure-theoretic reconstructionof the approximation schemes developed for LabelledMarkov Processes: approximants are seen as quotientswith respect to sets of temporal properties expressedin a simple logic. This gives the possibility ofcustomizing approximants with respect to properties ofinterest and is thus an important step towards usingautomated techniques intended for finite state systems,e.g. model checking, for continuous state systems.The measure-theoretic apparatus meshes well withan enriched logic, extended with a greatest fix-point,and gives means to define approximants which retaincyclic properties of their target.