research-article

On the expressiveness and complexity of randomization in finite state monitors

Authors:

A. Prasad Sistla,

Mahesh ViswanathanAuthors Info & Claims

Journal of the ACM (JACM), Volume 56, Issue 5

Article No.: 26, Pages 1 - 44

https://doi.org/10.1145/1552285.1552287

Published: 21 August 2009 Publication History

Abstract

In this article, we introduce the model of finite state probabilistic monitors (FPM), which are finite state automata on infinite strings that have probabilistic transitions and an absorbing reject state. FPMs are a natural automata model that can be seen as either randomized run-time monitoring algorithms or as models of open, probabilistic reactive systems that can fail. We give a number of results that characterize, topologically as well as with respect to their computational power, the sets of languages recognized by FPMs. We also study the emptiness and universality problems for such automata and give exact complexity bounds for these problems.

References

[1]

Alpern, B., and Schneider, F. 1985. Defining liveness. Inf. Proc. Lett. 21, 181--185.

[2]

Amorium, M., and Rosu, G. 2005. Efficient monitoring of omega-languages. In Proceedings of the International Conference on Computer Aided Verification'. Lecture Notes in Computer Science, vol. 3576. Springer-Verlag, Berlin, 364--378.

Digital Library

[3]

Baier, C., Bertrand, N., and Gr&#246;&#223;er, M. 2008. On decision problems for probabilistic B&#252;chi automata. In Proceedings of the 11th International Conference on Foundations of Software Science and Computational Structures. Lecture Notes in Computer Science. Springer-Verlag, Berlin, Germany (FoSSaCS). 287--301.

Digital Library

[4]

Baier, C. and Gr&#246;&#223;er, M. 2005. Recognizing &#969;-regular languages with probabilistic automata. In Proceedings of the IEEE Symposium on Login in Computer Science. IEEE Computer Society Press, Los Alamitos, 137--146.

Digital Library

[5]

Bauer, A., Leucker, M., and Schallhart, C. 2006. Monitoring of real-time properties. In Proceedings of the 26th Conference on Foundations of Software Technology and Theoretical Computer Science. Springer-Verlag, Berlin, Germany, 260--272.

Digital Library

[6]

Chadha, R., Sistla, A. P., and Viswanathan, M. 2008. On the expressiveness and complexity of randomization in finite state monitors. In Proceedings of the 23rd Annual IEEE Symposium on Logic in Computer Science (LICS 2008). IEEE Computer Society Press, Los Alamitos, 18--29.

Digital Library

[7]

Chen, F., and Rosu, G. 2007. MOP: An efficient and generic runtime verification framework. In Proceedings of the ACM International Conference on Object-Oriented Programming, Systems, Languages, and Applications. ACM, New York, 569--588.

Digital Library

[8]

Condon, A., and Lipton, R. J. 1989. On the complexity of space bounded interactive proofs (extended abstract). In Proceedings of the 30th Annual Symposium on Foundations of Computer Science. IEEE Computer Society, Press Los Alamitos, 462--467.

Digital Library

[9]

Diaz, M., Juanole, G., and Courtiat, J. P. 1994. Observer: A concept for formal on-line validation of distributed systems. IEEE Trans. Softw. Eng. 20, 12, 900--913.

Digital Library

[10]

Freivalds, R. 1981. Probabilistic two-way machines. In Proceeding of the Mathematical Foundations of Computer Science. Springer-Verlag, Berlin, Germany, 33--45.

Digital Library

[11]

Gates, A., and Roach, S. 2001. Dynamics: Comprehensive support for runtime monitoring. In Runtime Verification. ENTCS. Elsevier Publishing, Amsterdam, The Netherlands.

[12]

Gondi, K., Patel, Y., and Sistla, A. P. 2009. Monitoring the full range of omega-regular properties of stochastic systems. In Proceedings of International Conference on Verification, Model Checking and Abstract Interpretation. Lecture Notes in Computer Science, vol. 5403. Springer-Verlag, Berlin, Germany, 105--119.

Digital Library

[13]

Hamlen, K. W., Morrisett, G., and Schneider, F. 2006. Computability classes for enforcement mechanisms. ACM Trans. Program. Lang. Syst. 28, 1, 175--205.

Digital Library

[14]

Havelund, K., and Rosu, G. 2001. Monitoring java programs with JavaPathExplorer. In Runtime Verification. ENTCS. Elsevier Publishing, Amesterdam, The Netherlands.

[15]

Immerman, N. 1988. Nondeterministic space is closed under complementation. SIAM J. Comput. 17, 935--938.

Digital Library

[16]

Jeffery, C., Zhou, W., Templer, K., and Brazell, M. 1998. A lightweight architechture for program execution monitoring. In Proceedings of the ACM Workshop on Program Analysis for Software Tools and Engineering. ACM, New York, 67--74.

Digital Library

[17]

Kemeny, J., and Snell, J. 1976. Denumerable Markov Chains. Springer-Verlag, Berlin, Germany.

[18]

Kim, M., Viswanathan, M., B.-Abdullah, H., Kannan, S., Lee, I., and Sokolsky, O. 1999. Formally specified monitoring of temporal properties. In Proceedings of the IEEE Euromicro Conference on Real-time Systems. IEEE Computer Society Press, Los Alamitos, 114--122.

[19]

Kortenkamp, D., Milam, T., Simmons, R., and Fernandez, J. L. 2001. Collecting and analyzing data from distributed control programs. In Runtime Verification. ENTCS. Elsevier Publishing, Amesterdam, The Netherlands.

[20]

Lamport, L. 1985. Logical foundation, distributed systems: Methods and tools for specification. Lecture Notes in Computer Science, vol. 190. Springer-Verlag, Berlin, Germany.

Digital Library

[21]

Ligatti, J. 2006. Policy enforcement via program monitoring. Ph.D. dissertation, Princeton Univ., Princeton.

Digital Library

[22]

Ligatti, J., Bauer, L., and Walker, D. 2005. Edit automata: Enforcement mechanisms for runtime security policies. Int. J. Inf. Sec. 4, 1--2 (Feb.), 2--16.

Digital Library

[23]

Ligatti, J., Bauer, L., and Walker, D. 2009. Runtime enforcement of nonsafety policy. ACM Trans. Inf. Syst. Sec. 12, 3, 1--41.

Digital Library

[24]

Mansouri-Samani, M., and Sloman, M. 1992. Monitoring distributed systems: A survey. Res. Rep. DOC92/93, Imperial College, London, UK.

[25]

Margaria, T., Sistla, A. P., Steffen, B., and Zuck, L. D. 2005. Taming interface specifications. In Proceedings of 16th International Conference on Concurrency Theory (CONCUR). Springer-Verlag, Berlin, Germany, 548--561.

Digital Library

[26]

Nasu, M., and Honda, N. 1968. Fuzzy events realized by finite probabilistic automata. Inf. Cont. 12, 4, 284--303.

[27]

Papoulis, A., and Pillai, S. U. 2002. Probability, Random Variables and Stochastic Processes. McGraw Hill, New York.

[28]

Paxson, V. 1997. Automated packet trace analysis of TCP implementations. Computer Commun. Rev. 27, 4, 167--179.

Digital Library

[29]

Paz, A. 1971. Introduction to Probabilistic Automata. Academic Press, Orlando.

Digital Library

[30]

Perrin, D., and Pin, J.-E. 2004. Infinite Words: Automata, Semigroups, Logic and Games. Elseiver, Amesterdam, The Netherlands.

[31]

Plattner, B., and Nievergelt, J. 1981. Monitoring program execution: A survey. IEEE Comput. 14, 1 (Nov.), 76--93.

Digital Library

[32]

Pnueli, A., and Zaks, A. 2006. PSL model checking and runtime verification via testers. In Proceedings of the 14th International Symposium on Formal Methods. Springer-Verlag, Berlin Germany, 573--586.

Digital Library

[33]

Rabin, M. O. 1963. Probabilitic automata. Inf. Cont. 6, 3, 230--245.

[34]

Ranum, M. J., Landfield, K., Stolarchuk, M., Sienkiewicz, M., Lambeth, A., and Wall, E. 1997. Implementing a generalized tool for network monitoring. In Proceedings of the Systems Administration Conference. USENIX Association, 1--8.

Digital Library

[35]

Salomaa, A. 1973. Formal Languages. Academic Press, Orlando.

Digital Library

[36]

Sammapun, U., Lee, I., Sokolsky, O., and Regehr, J. 2007. Statistical runtime checking of probabilistic properties. In Proceedings of the 7th International Workshop on Runtime Verification. Springer-Verlag, Berlin, Germany, 164--175.

Digital Library

[37]

Schneider, F. B. 2000. Enforceable security policies. ACM Trans. Inf. Syst. Sec. 3, 1, 30--50.

Digital Library

[38]

Schroeder, B. A. 1995. Online monitoring: A tutorial. IEEE Compu., 72--78.

Digital Library

[39]

Sistla, A. P. 1985. On characterization of safety and liveness properties in temporal logic. In Proceedings of the ACM Symposium on Principle of Distributed Computing. ACM, New York, 39--48.

Digital Library

[40]

Sistla, A. P., and Srinivas, A. R. 2008. Monitoring temporal properties of stochastic systems. In Proceedings of International Conference on Verification, Model Checking and Abstract Interpretation. Lecture Notes in Computer Science, vol. 4905. Springer-Verlag, Berlin, Germany, 294--308.

Digital Library

[41]

Szelepcsenyi, R. 1987. The method of forcing for nondeterministic automata. Bull. EATCS 33, 96--100.

[42]

Thomas, W. 1990. Automata on infinite objects. In Handbook of Theoretical Computer Science. vol. B. Elsevier, Amsterdam, The Netherlands, 133--192.

Digital Library

[43]

Time Rover. 1997. http://www.time-rover.com.

[44]

Vardi, M. 1985. Automatic verification of probabilistic concurrent systems. In Proceedings of the 26th Annual Symposium on Foundations of Computer Science. IEEE Computer Society Press, 327--338.

Digital Library

[45]

Viswanathan, M. 2000. Foundations for the runtime analysis of software systems. Ph.D. dissertation. University of Pennsylvania.

Digital Library

Cited By

Ziemek RPiribauer JFunke FJantsch SBaier C(2022)Probabilistic causes in Markov chainsInnovations in Systems and Software Engineering10.1007/s11334-022-00452-818:3(347-367)Online publication date: 1-Sep-2022
https://dl.acm.org/doi/10.1007/s11334-022-00452-8
Baier CFunke FJantsch SPiribauer JZiemek R(2021)Probabilistic Causes in Markov ChainsAutomated Technology for Verification and Analysis10.1007/978-3-030-88885-5_14(205-221)Online publication date: 12-Oct-2021
https://doi.org/10.1007/978-3-030-88885-5_14
Ben YChadha RSistla AViswanathan M(2019)Decidable and expressive classes of probabilistic automataJournal of Computer and System Sciences10.1016/j.jcss.2018.09.002100(70-95)Online publication date: Mar-2019
https://doi.org/10.1016/j.jcss.2018.09.002
Show More Cited By

Recommendations

Randomization in Automata on Infinite Trees

We study finite automata running over infinite binary trees. A run of such an automaton over an input tree is a tree labeled by control states of the automaton: the labeling is built in a top-down fashion and should be consistent with the transitions of ...
Languages recognized by nondeterministic quantum finite automata

The nondeterministic quantum finite automaton (NQFA) is the only known case wherea one-way quantum finite automaton (QFA) model has been shown to be strictly superiorin terms of language recognition power to its probabilistic counterpart. We give ...
The parallel complexity of finite-state automata problems

The goal of this paper is to study the exact complexity of several important problems concerning finite-state automata and to classify the degrees of ambiguity of nondeterministic finite-state automata. Our results are as follows: (1) Minimization of ...

Comments

Information & Contributors

Information

Published In

cover image Journal of the ACM

Journal of the ACM Volume 56, Issue 5

August 2009

164 pages

ISSN:0004-5411

EISSN:1557-735X

DOI:10.1145/1552285

Issue’s Table of Contents

Copyright © 2009 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 21 August 2009

Accepted: 01 March 2009

Revised: 01 March 2009

Received: 01 October 2008

Published in JACM Volume 56, Issue 5

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article
Research
Refereed

Funding Sources

Division of Computing and Communication Foundations

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

18
Total Citations
View Citations
468
Total Downloads

Downloads (Last 12 months)3
Downloads (Last 6 weeks)0

Reflects downloads up to 01 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

Ziemek RPiribauer JFunke FJantsch SBaier C(2022)Probabilistic causes in Markov chainsInnovations in Systems and Software Engineering10.1007/s11334-022-00452-818:3(347-367)Online publication date: 1-Sep-2022
https://dl.acm.org/doi/10.1007/s11334-022-00452-8
Baier CFunke FJantsch SPiribauer JZiemek R(2021)Probabilistic Causes in Markov ChainsAutomated Technology for Verification and Analysis10.1007/978-3-030-88885-5_14(205-221)Online publication date: 12-Oct-2021
https://doi.org/10.1007/978-3-030-88885-5_14
Ben YChadha RSistla AViswanathan M(2019)Decidable and expressive classes of probabilistic automataJournal of Computer and System Sciences10.1016/j.jcss.2018.09.002100(70-95)Online publication date: Mar-2019
https://doi.org/10.1016/j.jcss.2018.09.002
Kannan SKim MLee ISokolsky OViswanathan M(2019)A Retrospective Look at the Monitoring and Checking (MaC) FrameworkRuntime Verification10.1007/978-3-030-32079-9_1(1-14)Online publication date: 8-Oct-2019
https://dl.acm.org/doi/10.1007/978-3-030-32079-9_1
Chadha RSistla AViswanathan M(2017)Emptiness Under Isolation and the Value Problem for Hierarchical Probabilistic AutomataProceedings of the 20th International Conference on Foundations of Software Science and Computation Structures - Volume 1020310.1007/978-3-662-54458-7_14(231-247)Online publication date: 22-Apr-2017
https://dl.acm.org/doi/10.1007/978-3-662-54458-7_14
Kini DViswanathan M(2015)Limit Deterministic and Probabilistic Automata for LTL \ GUProceedings of the 21st International Conference on Tools and Algorithms for the Construction and Analysis of Systems - Volume 903510.1007/978-3-662-46681-0_57(628-642)Online publication date: 11-Apr-2015
https://dl.acm.org/doi/10.1007/978-3-662-46681-0_57
Chadha RSistla AViswanathan MBen Y(2015)Decidable and Expressive Classes of Probabilistic AutomataFoundations of Software Science and Computation Structures10.1007/978-3-662-46678-0_13(200-214)Online publication date: 2015
https://doi.org/10.1007/978-3-662-46678-0_13
Chatterjee KDoyen L(2014)Partial-Observation Stochastic GamesACM Transactions on Computational Logic10.1145/257982115:2(1-44)Online publication date: 2-May-2014
https://dl.acm.org/doi/10.1145/2579821
Kini DViswanathan M(2014)Probabilistic Automata for Safety LTL SpecificationsProceedings of the 15th International Conference on Verification, Model Checking, and Abstract Interpretation - Volume 831810.1007/978-3-642-54013-4_7(118-136)Online publication date: 19-Jan-2014
https://dl.acm.org/doi/10.1007/978-3-642-54013-4_7
Chatterjee KDoyen LHenzinger T(2013)A survey of partial-observation stochastic parity gamesFormal Methods in System Design10.1007/s10703-012-0164-243:2(268-284)Online publication date: 1-Oct-2013
https://dl.acm.org/doi/10.1007/s10703-012-0164-2
Show More Cited By

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Article

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Media

Figures

Other

Tables

View Issue’s Table of Contents