Summary: [Le90] 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.
[LS82] D. Lehman, S. Shelah, ``Reasoning with time and chance,'' Information and Con­
trol 53, 1982.
[PZ86] A. Pnueli, L. Zuck, ``Probabilistic verification by tableaux,'' In Proceedings of the
First IEEE Symposium on Logic in Computer Science, 1986.
[Sh87] G.S. Shedler, Regeneration and Networks of Queues, Springer­Verlag, 1987.
[Th90] W. Thomas, ``Automata on infinite objects,'' Handbook of Theoretical Computer
Science, volume B, pages 133­191, 1990.
[Wh80] W. Whitt, ``Continuity of generalized semi­Markov processes,'' Math. Oper. Res.
5,1980.
[Va85] M. Vardi, ``Automatic verification of probabilistic concurrent finite­state pro­
grams,'' In Proceedings of the 26th IEEE Symposium on Foundations of Computer
Science, pages 327­338, 1985.

fications. We do not yet know how to check properties specified using nondeterministic
timed automata or using linear real­time logics.
The algorithm outlined here is expensive. To make it more practical, some heuris­
tic techniques need to be devised. Observe that the verification problems are typically
PSPACE, even in the absence of real­time and probabilities. We feel hopeful that the

Source: Alur, Rajeev - Department of Computer and Information Science, University of Pennsylvania

Collections: Computer Technologies and Information Sciences