On the expressiveness and complexity of randomization in finite state monitors

Proceedings - Symposium on Logic in Computer Science

Volumn , Issue , 2008, Pages 18-29

  Chadha, Rohit ^a   Sistla, A Prasad ^b   Viswanathan, Mahesh ^a  

^a University of Illinois at Urbana Champaign   (United States)

^b University of Illinois at Chicago   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

FORMAL VERIFICATIONS; LOGIC IN COMPUTER SCIENCE; RUN-TIME MONITORING;

COMPUTER NETWORKS; COMPUTER SCIENCE; COMPUTERS; GROUND OPERATIONS; LEARNING SYSTEMS; MILITARY OPERATIONS;

AUTOMATA THEORY;

EID: 51549092366     PISSN: 10436871     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/LICS.2008.42     Document Type: Conference Paper

References (21)

1. Proceedings of the Workshop in Runtime Verification, Electronic Notes in Theoretical Computer Science, 1999-2007.
2. B. Alpern and F. Schneider. Defining liveness. Information Processing Letters, 21:181-185, 1985.
3. M. Amorium and G. Rosu. Efficient monitoring of omega-languages. In Proceedings of the International Conference on Computer Aided Verification, pages 364-378, 2005.
4. C. Baier and M. Gröβer. Recognizing ω-regular languages with probabilistic automata. In Proceedings of the IEEE Symposium on Login in Computer Science, pages 137-146, 2005.
5. A. Bauer, M. Leucker, and C. Schallhart. Monitoring of real-time properties. In Proceedings of the 26th Conference on Foundations of Software Technology and Theoretical Computer Science, pages 260-272, 2006.
6. J. Kemeny and J. Snell. Denumerable Markov Chains. Springer-Verlag, 1976.
7. L. Lamport. Logical foundation, distributed systemsmethods and tools for specification. Springer-Verlag Lecture Notes in Computer Science, 190, 1985.
8. T. Margaria, A. P. Sistla, B. Steffen, and L. D. Zuck. Taming interface specifications. In Proceedings of 16th International Conference on Concurrency Theory (CONCUR), pages 548-561, 2005.
9. M. Nasu and N. Honda. Fuzzy events realized by finite probabilistic automata. Information and Control, 12(4):284-303, 1968.
10. A. Papoulis and S. U. Pillai. Probability, Random Variables and Stochastic Processes. McGraw Hill, New York, 2002.
11. A. Paz. Introduction to Probabilistic Automata. Academic Press, 1971.
12. D. Perrin and J-E. Pin. Infinite Words: Automata, Semigroups, Logic and Games. Elseiver, 2004.
13. A. Pnueli and A. Zaks. Psl model checking and runtime verification via testers. In Proceedings of the 14th International Symposium on Formal Methods, pages 573-586, 2006.
14. M.O. Rabin. Probabilitic automata. Information and Control, 6(3):230-245, 1963.
15. A. Salomaa. Formal Languages. Academic Press, 1973.
16. U. Sammapun, I. Lee, O. Sokolsky, and J. Regehr. Statistical runtime checking of probabilistic properties. In Proceedings of the 7th International Workshop on Runtime Verification, pages 164-175, 2007.
17. F. B. Schneider. Enforceable security policies. ACM Transactions on Information Systems Security, 3(1):30-50, 2000.
18. A. P. Sistla. On characterization of safety and liveness properties in temporal logic. In Proceedings of the ACM Symposium on Principle of Distributed Computing, 1985.
19. A. P. Sistla and A. R. Srinivas. Monitoring temporal properties of stochastic systems. In Proceedings of International Conference on Verification, Model Checking and Abstract Interpretation, 2008.
20. W. Thomas. Automata on infinite objects. In Handbook of Theoretical Computer Science, volume B, pages 133-192. 1990.
21. M. Vardi. Automatic verification of probabilistic concurrent systems. In 26th annual Symposium on Foundations of Computer Science, pages 327-338. IEEE Computer Society Press, 1985.