Affiliation:
1. Univ. of Crete; and ICS, Farth, Heraklion, Greece
2. AT&T Bell Labs, Murray Hill, NJ
Abstract
We determine the complexity of testing whether a finite state, sequential or concurrent probabilistic program satisfies its specification expressed in linear-time temporal logic. For sequential programs, we present an algorithm that runs in time linear in the program and exponential in the specification, and also show that the problem is in PSPACE, matching the known lower bound. For concurrent programs, we show that the problem can be solved in time polynomial in the program and doubly exponential in the specification, and prove that it is complete for double exponential time. We also address these questions for specifications described by ω-automata or formulas in extended temporal logic.
Publisher
Association for Computing Machinery (ACM)
Subject
Artificial Intelligence,Hardware and Architecture,Information Systems,Control and Systems Engineering,Software
Reference32 articles.
1. ~BREIMAN L. 1968. Probabih_ty Addison-Wesley Reading Mass. ~BREIMAN L. 1968. Probabih_ty Addison-Wesley Reading Mass.
2. Alternation
Cited by
377 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Enforcing Resilience in Cyber-physical Systems via Equilibrium Verification at Runtime;ACM Transactions on Autonomous and Adaptive Systems;2023-09-20
2. Markov chains and unambiguous automata;Journal of Computer and System Sciences;2023-09
3. Qualitative reachability for open interval Markov chains;PeerJ Computer Science;2023-08-28
4. The Probabilistic Rabin Tree Theorem*;2023 38th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS);2023-06-26
5. Stopping Criteria for Value Iteration on Stochastic Games with Quantitative Objectives;2023 38th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS);2023-06-26