Controller dependability analysis by probabilistic model checking

Control Engineering Practice

Volumn 15, Issue 11, 2007, Pages 1427-1434

  Kwiatkowska, Marta ^a   Norman, Gethin ^a   Parker, David ^a  

^a UNIVERSITY OF BIRMINGHAM   (United Kingdom)

Author keywords

Formal verification; Markov models; Performance analysis

Indexed keywords

COMPUTER CONTROL SYSTEMS; COMPUTER SOFTWARE; MARKOV PROCESSES; MATHEMATICAL MODELS; PROBABILITY; STOCHASTIC MODELS; VERIFICATION;

FORMAL VERIFICATION; PERFORMANCE ANALYSIS; SOFTWARE-BASED CONTROL SYSTEM;

CONTROL SYSTEM ANALYSIS;

COMPUTER CONTROL SYSTEMS; COMPUTER SOFTWARE; CONTROL SYSTEM ANALYSIS; MARKOV PROCESSES; MATHEMATICAL MODELS; PROBABILITY; STOCHASTIC MODELS; VERIFICATION;

EID: 34548297216     PISSN: 09670661     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.conengprac.2006.07.003     Document Type: Article

References (21)

1. Alur R., and Henzinger T. Reactive modules. Formal Methods in System Design 15 1 (1999) 7-48
2. Aziz, A., Sanwal, K., Singhal, V., & Brayton, R. (1996). Verifying continuous time Markov chains. In R. Alur, T. Henzinger (Eds.), Proceedings of the eighth international conference on computer aided verification (CAV'96), Lecture Notes on Computer Science (Vol. 1102, pp. 269-276). Berlin: Springer.
3. Baier, C., Haverkort, B., Hermanns, H., & Katoen, J.-P. (2000). On the logical characterisation of performability properties. In U. Montanari, J. Rolim, E. Welzl (Eds.), Proceedings of the 27th international colloquium on automata, languages and programming (ICALP'00), Lecture Notes on Computer Science (Vol. 1853, pp. 780-792). Berlin: Springer.
4. Baier C., Haverkort B., Hermanns H., and Katoen J.-P. Model-checking algorithms for continuous-time Markov chains. IEEE Transactions on Software Engineering 29 6 (2003) 524-541
5. Baier, C., Katoen, J.-P., & Hermanns, H. (1999). Approximate symbolic model checking of continuous-time Markov chains. In J. Baeten, S. Mauw (Eds.), Proceedings of the 10th international conference on concurrency theory (CONCUR'99), Lecture Notes on Computer Science (Vol. 1664, pp. 146-161). Berlin: Springer.
6. Bryant, R. (1995). Binary decision diagrams and beyond: Enabling technologies for formal verification. In Proceedings of the international conference on computer-aided design (ICCAD'95) (pp. 236-243).
7. Clarke E., Grumberg O., and Peled D. Model checking (1999), The MIT Press, Cambridge, MA
8. de Alfaro, L. (1997). Formal verification of probabilistic systems. Ph.D. thesis, Stanford University.
9. Duflot, M., Kwiatkowska, M., Norman, G., & Parker, D. (2004). A formal analysis of bluetooth device discovery. In Proceedings of the first international symposium on leveraging applications of formal methods (ISOLA'04).
10. Kwiatkowska, M., & Norman, G. (2002). Verifying randomized Byzantine agreement. In D. Peled, M. Vardi (Eds.), Proceedings of the formal techniques for networked and distributed systems (FORTE'02), Lecture Notes on Computer Science (Vol. 2529, pp. 194-209). Berlin: Springer.
11. Kwiatkowska, M., Norman, G., & Parker, D. (2004). PRISM 2.0: A tool for probabilistic model checking. In Proceedings of the first international conference on quantitative evaluation of systems (QEST'04) (pp. 322-323). IEEE Computer Society Press.
12. Kwiatkowska, M., Norman, G., Parker, D., & Sproston, J. (2003). Performance analysis of probabilistic timed automata using digital clocks. In K. Larsen, P. Niebert (Eds.), Proceedings of the formal modeling and analysis of timed systems (FORMATS'03), Lecture Notes on Computer Science (Vol. 2791, pp. 105-120). Berlin: Springer.
13. Kwiatkowska, M., Norman, G., & Segala, R. (2001). Automated verification of a randomized distributed consensus protocol using Cadence SMV and PRISM. In G. Berry, H. Comon, A. Finkel (Eds.), Proceedings of the 13th international conference on computer aided verification (CAV'01). Lecture Notes on Computer Science (Vol. 2102, pp. 194-206). Berlin: Springer.
14. Kwiatkowska M., Norman G., and Sproston J. Probabilistic model checking of deadline properties in the IEEE 1394 FireWire root contention protocol. Formal Aspects of Computing 14 3 (2003) 295-318
15. Lanotte, R., Maggiolo-Schettini, A., & Troina, A. (2004). Automatic analysis of a non-repudiation protocol. In Proceedings of the second international workshop on quantitative aspects of programming languages (QAPL'04).
16. Muppala J., Ciardo G., and Trivedi K. Stochastic reward nets for reliability prediction. Communications in Reliability, Maintainability and Serviceability 1 2 (1994) 9-20
17. Norman G., Parker D., Kwiatkowska M., and Shukla S. Evaluating the reliability of NAND multiplexing with PRISM. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems 24 10 (2005) 1629-1637
18. Norman G., Parker D., Kwiatkowska M., Shukla S., and Gupta R. Formal analysis and validation of continuous time Markov chain based system level power management strategies. In: Rosenstiel W. (Ed). Proceedings of the seventh annual IEEE international workshop on high level design validation and test (HLDVT'02) (2002), IEEE Computer Society Press, Silver Spring, MD 45-50
19. Norman, G., & Shmatikov, V., 2003. Analysis of probabilistic contract signing. In A. Abdallah, P. Ryan, S. Schneider (Eds.), Proceedings of the BCS-FACS formal aspects of security (FASec'02), Lecture Notes in Computer Science (Vol. 2629, pp. 81-96). Berlin: Springer.
20. Rutten, J., Kwiatkowska, M., Norman, G., & Parker, D. (2004). In P. Panangaden, F. van Breugel (Eds.), Mathematical techniques for analyzing concurrent and probabilistic systems, CRM monograph series (Vol. 23). Providence, RI: American Mathematical Society.
21. Shmatikov V. Probabilistic model checking of an anonymity system. Journal of Computer Security 12 3/4 (2004) 355-377