2000/02/04 by Jeremy Bryans, Howard Bowman, Bryans, Jeremy +3
Computer Science · #F.3.1 #F.4.1 #FOS: Computer and information sciences #Formal Methods in Verification #G.3 #Logic in Computer Science (cs.LO) #Multimedia (cs.MM) #Software Reliability and Analysis Research #Software Testing and Debugging Techniques #cs.LO #cs.MM
paper · pdf · doi:10.48550/arxiv.cs/0002004
35 pages; 6 figures
arxiv created 2000/02/04 · openalex publication_date 2000/02/04 · arxiv updated 2009/11/30 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
Modern distributed systems include a class of applications in which non-functional requirements are important. In particular, these applications include multimedia facilities where real time constraints are crucial to their correct functioning. In order to specify such systems it is necessary to describe that events occur at times given by probability distributions and stochastic automata have emerged as a useful technique by which such systems can be specified and verified. However, stochastic descriptions are very general, in particular they allow the use of general probability distribution functions, and therefore their verification can be complex. In the last few years, model checking has emerged as a useful verification tool for large systems. In this paper we describe two model checking algorithms for stochastic automata. These algorithms consider how properties written in a simple probabilistic real-time logic can be checked against a given stochastic automaton.