Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Rajeev Alur, Costas Courcoubetis, and David Dill. Model checking in dense real-time. Information and Computation, 104(1):2–34, May 1993.
Rajeev Alur and David Dill. A theory of timed automata. Theoretical Computer Science, 126:183–235, 1994.
Christel Baier and Marta Kwiatkowska. Model checking for a probabilistic branching time logic with fairness. Distributed Computing, 11:125–155, May 1998.
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.
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.
Howard Bowman, Jeremy Bryans, and John Derrick. A model checking algorithm for stochastic systems. Technical Report 4-00, University of Kent at Canterbury, 2000.
Jeremy Bryans and John Derrick. Stochastic specification and verification. In Proceedings of Third Irish Workshop in Formal Methods, 1999.
Edmund Clarke, Orna Grumberg, and Doron Peled. Model Checking. MIT Press, 1999.
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, 1
C.A.R. Hoare. Communicating Sequential Processes. Prentice Hall International, 1985.
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.
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.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bryans, J., Blair, L., Bowman, H., Derrick, J. (2000). Specification and Analysis of Automata-Based Designs. In: Grieskamp, W., Santen, T., Stoddart, B. (eds) Integrated Formal Methods. IFM 2000. Lecture Notes in Computer Science, vol 1945. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-40911-4_11
Download citation
DOI: https://doi.org/10.1007/3-540-40911-4_11
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-41196-3
Online ISBN: 978-3-540-40911-3
eBook Packages: Springer Book Archive