Action and State Based Computation Tree Measurement Language and Algorithms
From MaRDI portal
Publication:6104809
Logic in computer science (03B70) Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20) Specification and verification (program logics, model checking, etc.) (68Q60) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)
Recommendations
Cites work
- A decomposition approach for stochastic reward net models
- A logic for reasoning about time and reliability
- scientific article; zbMATH DE number 420915 (Why is no real title available?)
- scientific article; zbMATH DE number 3145626 (Why is no real title available?)
- scientific article; zbMATH DE number 3680123 (Why is no real title available?)
- scientific article; zbMATH DE number 729460 (Why is no real title available?)
- scientific article; zbMATH DE number 2196601 (Why is no real title available?)
- On the logical characterisation of performability properties
- Probabilistic verification of Herman's self-stabilisation algorithm
- State-space support for path-based reward variables
- The complexity of probabilistic verification
- The temporal semantics of concurrent programs
- Towards model checking stochastic process algebra
This page was built for publication: Action and State Based Computation Tree Measurement Language and Algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6104809)