Specification and Analysis of Automata-Based Designs
One of the results of research into formal system specification has been the large number of notations which have been developed. Of these notations, automata have emerged as a promising vehicle for the specification, and particularly the analysis, of systems. This is especially so when the systems under consideration include timing requirements, and timed automata model such systems as a finite set of states with timed transitions between them. However, not all specifications involve deterministic timing, and stochastic automata can be used in these circumstances.
In this paper we consider both timed and stochastic automata, and demonstrate how they can be used in the same design.We will also consider what analysis of the specification can then be performed. In particular, we will describe how to translate stochastic to timed automata, and look at two approaches to model checking the stochastic components of an integrated design.
KeywordsTimed automata stochastic automata model checking
Unable to display preview. Download preview PDF.
- 3.Christel Baier and Marta Kwiatkowska. Model checking for a probabilistic branching time logic with fairness. Distributed Computing, 11:125–155, May 1998.Google Scholar
- 4.Sébastien Bornot and Joseph Sifakis. On the composition of hybred systems. In International Workshop on Hybred Systems: Computation and Control, volume LNCS 1386, pages 49–63, April 1998.Google Scholar
- 5.Sébastien Bornot, Joseph Sifakis, and Stavros Tripakis. Modeling urgency in timed systems. In W.-P. de Roever, H. Langmaack, and A. Pnueli, editors, International Symposium: Compositionality-The significant difference, volume 1536 of LNCS. Springer-Verlag, 1998.Google Scholar
- 6.Howard Bowman, Jeremy Bryans, and John Derrick. A model checking algorithm for stochastic systems. Technical Report 4-00, University of Kent at Canterbury, 2000.Google Scholar
- 7.Jeremy Bryans and John Derrick. Stochastic specification and verification. In Proceedings of Third Irish Workshop in Formal Methods, 1999.Google Scholar
- 8.Edmund Clarke, Orna Grumberg, and Doron Peled. Model Checking. MIT Press, 1999.Google Scholar
- 10.Pedro R. D’Argenio, Joost-Pieter Katoen, and Ed Brinksma. An algebraic approach to the specification of stochastic systems (extended abstract). In D. Gries and W.-P. de Roever, editors, Proceedings of the Working Conference on Programming Concepts and Methods. Chapman & Hall, 1Google Scholar
- 11.C.A.R. Hoare. Communicating Sequential Processes. Prentice Hall International, 1985.Google Scholar
- 12.Trevor Jones and Lynne Blair. A Tool-Suite for Simulating, Composing and Editing Timed Automata (LUSCETA: Users Manual Release 1.0). Technical Report MPG-99-24, Computing Department, Lancaster University, 1999.Google Scholar
- 13.Marta Kwiatkowska, Gethin Norman, Roberto Segala, and Jeremy Sprouston. Verifying Quantitative Properties of Continuous Probabilistic Real-Time Graphs. In CONCUR’00, 2000. Also available as a University of Birmingham technical report: CSR-00-06.Google Scholar