Abstract
We present a model-checking algorithm for a system presented as a generalized semi-Markov process and a specification given as a deterministic timed automaton. This leads to a method for automatic verification of timing properties of finite-state probabilistic real-time systems.
Supported by ESPRIT BRA project SPEC.
Supported by the NSF under grant MIP-8858807.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
R. Alur, C. Courcoubetis, D.L. Dill, “Model-checking for real-time systems,” In Proceedings of the Fifth IEEE Symposium on Logic in Computer Science, pages 414–425, 1990.
R. Alur, C. Courcoubetis, D.L. Dill, “Model-checking for probabilistic real-time systems,” In Automata, Languages, and Programming: Proceedings of the 18th ICALP, Lecture Notes in Computer Science 510, 1991.
R. Alur, D.L. Dill, “Automata for modeling real-time systems,” In Automata, Languages, and Programming: Proceedings of the 17th ICALP, Lecture Notes in Computer Science 443, pages 322–335, 1990.
R. Alur, T.A. Henzinger, “A really temporal logic,” In Proceedings of the 30th IEEE Symposium on Foundations of Computer Science, pages 164–169, 1989.
J.R. Burch, E.M. Clarke, K.L. McMillan, D.L. Dill, L.J. Hwang, “Symbolic model-checking: 1020 states and beyond,” In Proceedings of the Fifth IEEE Symposium on Logic in Computer Science, pages 428–439, 1990.
C. Courcoubetis, M. Yannakakis, “Verifying temporal properties of finite-state probabilistic programs,” In Proceedings of the 29th IEEE Symposium on Foundations of Computer Science, pages 338–345, 1988.
E.A. Emerson, E.M. Clarke, “Using branching-time temporal logic to synthesize synchronization skeletons,” Science of Computer Programming 2, pages 241–266, 1982.
P. Godefroid, P. Wolper, “A partial approach to model-checking,” In Proceedings of the Sixth IEEE Symposium on Logic in Computer Science, pages 406–415, 1991.
H. Hansson, B. Jonsson, “A framework for reasoning about time and reliability,” In Proceedings of the Tenth IEEE Real-Time Systems Symposium, pages 102–111, 1989.
R. Koymans, “Specifying real-time properties with Metric Temporal Logic,” Journal of Real-Time Systems, 2, pages 255–299, 1990.
H.R. Lewis, “A logic of concrete time intervals,” In Proceedings of the Fifth IEEE Symposium on Logic in Computer Science, pages 380–389, 1990.
D. Lehman, S. Shelah, “Reasoning with time and chance,” Information and Control 53, 1982.
A. Pnueli, L. Zuck, “Probabilistic verification by tableaux,” In Proceedings of the First IEEE Symposium on Logic in Computer Science, 1986.
G.S. Shedler, Regeneration and Networks of Queues, Springer-Verlag, 1987.
W. Thomas, “Automata on infinite objects,” Handbook of Theoretical Computer Science, volume B, pages 133–191, 1990.
W. Whitt, “Continuity of generalized semi-Markov processes,” Math. Oper. Res. 5, 1980.
M. Vardi, “Automatic verification of probabilistic concurrent finite-state programs,” In Proceedings of the 26th IEEE Symposium on Foundations of Computer Science, pages 327–338, 1985.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1992 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Alur, R., Courcoubetis, C., Dill, D. (1992). Verifying automata specifications of probabilistic real-time systems. In: de Bakker, J.W., Huizing, C., de Roever, W.P., Rozenberg, G. (eds) Real-Time: Theory in Practice. REX 1991. Lecture Notes in Computer Science, vol 600. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0031986
Download citation
DOI: https://doi.org/10.1007/BFb0031986
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-55564-3
Online ISBN: 978-3-540-47218-6
eBook Packages: Springer Book Archive