Abstract
Many people have studied formal specification and verification methods of embedded and ubiquitous computing systems all over the world. We can specify real-time systems using timed automata, and verify them using model-checking. Especially, recently, probabilistic timed automata and their model-checking have been developed in order to express the relative likelihood of the distributed real-time systems exhibiting certain behavior. Moreover, model-checking and probabilistic timed simulation verification methods of probabilistic timed automata have been developed. In this paper, we propose probabilistic timed transition systems by generalizing probabilistic timed automata, and propose deductive verification rules of probabilistic real-time linear temporal logic over probabilistic timed transition systems. As our proposed probabilistic timed transition system is a general computational model, we have developed general verification methods.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Tilborg, A.M., Koob, G.M.: Foundations of Real-time Computing: Formal Specifications and Methods, p. 316. Kluwer Academic Pub., Dordrecht (1991)
de Bakker, J.W., Huizing, C., de Roever, W.P., Rozenberg, G.: REX 1991. LNCS, vol. 600. Springer, Heidelberg (1992)
Kavi, K.M.: Real-Time Systems Abstractions, Languages and Design Methodologies. IEEE Computer Society Press, Los Alamitos (1992)
Inan, M.K., Kurshan, R.P.: Verification of Digital and Hybrid Systems. NATO ASI Series F: Computer and Systems Sciences, Vol. 170, vol. 170. Springer, Heidelberg (2000)
Alur, R., Dill, D.L.: A theory of timed automata. Theoretical Computer Science 126, 183–235 (1994)
Alur, R., Courcoubetis, C., Dill, D.L.: Model-Checking in Dense Real-Time. Information and Computation 104, 2–34 (1993)
Henzinger, T.A., Nicollin, X., Sifakis, J., Yovine, S.: Symbolic model checking for real-time systems. Information and Computation 111, 193–244 (1994)
Kwiatkowska, M., Norman, G., Segala, R., Sproston, J.: Automatic verification of real-time systems with discrete probability distributions. Theoretical Computer Science 282, 101–150 (2002)
Yamane, S.: Probabilistic Timed Simulation Verification and its application to Stepwise Refinement of Real-Time Systems. In: Saraswat, V.A. (ed.) ASIAN 2003. LNCS, vol. 2896, pp. 276–290. Springer, Heidelberg (2003)
Hart, S., Sharir, M., Pnueli, A.: Termination of Probabilistic Concurrent Programs. ACM Transactions on Programming Languages 5, 356–380 (1983)
Sharir, M., Hart, S.: Probabilistic temporal logics for finite and bounded models. In: Proc. of the 16th ACM Symposium on Theory of Computing, pp. 1–13 (1984)
Lehmann, D., Shelah, S.: Reasoning about time and chance. Information and Control 53, 165–198 (1982)
Pnueli, A.: On the Extremely Fair Treatment of Probabilistic Algorithms. In: Proc. of the 15th ACM Symposium Theory of Computing, pp. 278–290 (1983)
Pnueli, A., Zuck, L.: Verification of multiprocess probabilistic protocols. Distributed Computing 1(1), 53–72 (1986)
Hansson, H.A.: Time and Probability in Formal Design of Distributed Systems. PhD thesis, Uppsala University (1991)
Alur, R., Courcoubetis, C., Dill, D.L.: Verifying automata specifications of probabilistic real-time systems. In: Huizing, C., de Bakker, J.W., Rozenberg, G., de Roever, W.-P. (eds.) REX 1991. LNCS, vol. 600, pp. 28–44. Springer, Heidelberg (1991)
Alur, R., Courcoubetis, C., Dill, D.L.: Model-checking for probabilistic real-time systems. In: Leach Albert, J., Monien, B., Rodríguez-Artalejo, M. (eds.) ICALP 1991. LNCS, vol. 510, pp. 115–136. Springer, Heidelberg (1991)
Lynch, N.A., Vaandrager, F.W.: Forward and Backward Simulations for Timing-Based Systems. In: Huizing, C., de Bakker, J.W., Rozenberg, G., de Roever, W.-P. (eds.) REX 1991. LNCS, vol. 600, pp. 397–446. Springer, Heidelberg (1992)
Segala, R.: Modeling and Verification of Randomized Distributed Real-Time Systems. PhD thesis, MIT (1995)
Kesten, Y., Manna, Z., Pnueli, A.: Verifying Clocked Transition Systems. In: Alur, R., Sontag, E.D., Henzinger, T.A. (eds.) HS 1995. LNCS, vol. 1066, pp. 13–40. Springer, Heidelberg (1996)
Kwiatkowska, M.Z., Norman, G., Sproston, J.: Probabilistic Model Checking of Deadline Properties in the IEEE 1394 FireWire Root Contention Protocol. Formal Aspects of Computing 14(3), 295–318 (2003)
Manna, Z., Pnueli, A.: Temporal Verification of Reactive Systems: Safety. Springer, Heidelberg (1995)
Manna, Z., Pnueli, A.: Temporal Verification of Reactive Systems: Progress. Unpublished, Stanford University (1996), http://theory.stanford.edu/zm/
Kwiatkowska, M.Z.: Model Checking for Probability and Time: From Theory to Practice. Invited talk at LICS 2003, pp.351–360 (2003)
Vardi, M.Y.: Automatic verification of probabilistic concurrent finite-state systems. In: Proc. 26th IEEE Symp. Found. of Comp. Sci., pp. 327–338 (1985)
Abadi, M., Lamport, L.: An Old-Fashioned Recipe for Real Time. ACM Transactions on Programming Languages and Systems 16(5), 1543–1571 (1994)
Emerson, E.A., Clarke, E.M.: Using Branching Time Temporal Logic to Synthesize Synchronization Skeletons. Science of Computer Programming 2(3), 241–266 (1982)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Yamane, S., Kanatani, T. (2004). Deductive Probabilistic Verification Methods for Embedded and Ubiquitous Computing. In: Yang, L.T., Guo, M., Gao, G.R., Jha, N.K. (eds) Embedded and Ubiquitous Computing. EUC 2004. Lecture Notes in Computer Science, vol 3207. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30121-9_18
Download citation
DOI: https://doi.org/10.1007/978-3-540-30121-9_18
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22906-3
Online ISBN: 978-3-540-30121-9
eBook Packages: Springer Book Archive