Probabilistic resource failure in real-time process algebra

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1466, Issue , 1998, Pages 389-404

  Philippou, Anna ^a   Cleaveland, Rance ^b   Lee, Insup ^a   Smolka, Scott ^c   Sokolsky, Oleg ^d  

^a UNIVERSITY OF PENNSYLVANIA   (United States)

^b UNIVERSITY OF NORTH CAROLINA   (United States)

^c STONY BROOK UNIVERSITY   (United States)

^d Computer Command and Control Company ^*  (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA; INTERACTIVE COMPUTER SYSTEMS; MODEL CHECKING; REAL TIME SYSTEMS; SPECIFICATIONS;

HENNESSY-MILNER LOGICS; MODEL CHECKING ALGORITHM; PROBABILISTIC ANALYSIS; PROBABILISTIC CONSTRAINTS; PROBABILISTIC EXTENSION; PROBABILISTIC VARIANT; PROBABILITY OF FAILURE; REAL-TIME PROCESS ALGEBRA;

COMPUTER CIRCUITS;

EID: 84945974249     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0055637     Document Type: Conference Paper

References (22)

1. R. Alur, L. Jagadeesan, J. Kott, and J. V. Olnhausen. Model-checking of real-time systems: a telecommunications application. In Proceedings of the International Conference on Software Engineering, 1997.
2. J. Baeten, J. Bergstra, and S. Smolka. Axiomatizing probabilistic processes: ACP with generative probabilities. Information and Computation, 121(2): 234-255, Sept. 1995.
3. C. Baier, E. Clarke, V. Hartonas-Garmhausen, M. Kwiatkowska, and M. Ryan. Symbolic model checking for probabilistic processes. In Proceedings of ICALP '97, volume 1256 of Lecture Notes in Computer Science, pages 430-440. Springer-Verlag, July 1997.
4. C. Baier and M. Kwiatkowska. Automatic verification of liveness properties of randomized systems (extended abstract). In Proceedings of the 14th Annual ACM Symposium on Principles of Distributed Computing, Santa Barbara, California, Aug. 1997.
5. H. Ben-Abdallah, D. Clarke, I. Lee, and O. Sokolsky. PARAGON: A Paradigm for the Specification, Verification, and Testing of Real-Time Systems. In IEEE Aerospace Conference, pages 469-488, Feb 1-8 1997.
6. A. Bianco and L. de Alfaro. Model checking of probabilistic and nondeterministic systems. In Proceedings Foundations of Software Techonology ans Theoretical Computer Science, volume 1026 of Lecture Notes in Computer Science, pages 499-513. Springer-Verlag, 1995.
7. E. Clarke and E. Emerson. Design and Synthesis of Synchronization Skeletons Using Branching Time Temporal Logic. LNCS 131, 1981.
8. E. Clarke, E. Emerson, and A. P. Sistla. Automatic verification of finite state concurrent systems using temporal logic specifications. ACM Trans. Prog. Lang. Syst., 8(2), 1986.
9. R. De Nicola and F. Vaandrager. Three logics for branching bisimulation. In Proceedngs of LICS '90. IEEE Computer Society Press, 1990.
10. A. Giacalone, C. Jou, and S. Smolka. Algebraic reasoning for probabilistic concurrent systems. In Proceedings of Working Conference on Programming Concepts and Methods, Sea of Gallilee, Israel, Apr. 1990. IFIP TC 2, North-Holland.
11. P. Haimos. Measure Theory. Springer Verlag, 1950.
12. H. Hansson. Time and Probability in Formal Design of Distributed Systems. PhD thesis, Department of Computer Systems, Uppsala University, 1991. DoCS 91/27.
13. H. Hansson and B. Jonsson. A logic for reasoning about time and probability. Formal Aspects of Computing, 6: 512-535, 1994.
14. P. Iyer and M. Narasimha. ‘almost always’ and ‘definitely sometime’ are not enough: Probabilistic quantifiers and probabilistic model checking. Technical Report TR-96-16, Department of Computer Science, North Carolina State University, July 1996.
15. H. Karloff. Linear Programming. Progress in Theoretical Computer Science. Birkhauser, 1991.
16. J.-P. Katoen, R. Langerak, and D. Latella. Modeling systems by probabilistic process algebra: An event structures approach. In Proceedings of FORTE '92 -Fifth International Conference on Formal Description Techniques, pages 255-270, Oct. 1993.
17. I. Lee, P. Brémond-Grégoire, and R. Gerber. A process algebraic approach to the specification and analysis of resource-bound real-time systems. Proceedings of the IEEE, pages 158-171, Jan 1994.
18. R. Segala. Modelling and Verification of Randomized Distributed Real-Time Systems. PhD thesis, Department of Electrical Engineering and Computer Science, Massachusetts Institute of Technology, 1995.
19. R. Segala and N. Lynch. Probabilistic simulations for probabilistic processes. In B. Jonsson and J. Parrow, editors, Proceedings CONCUR 94, Uppsala, Sweden, volume 836 of Lecture Notes in Computer Science, pages 481-496. Springer-Verlag, 1994.
20. K. Seidel. Probabilistic CSP. PhD thesis, Oxford University, 1992.
21. C. Tofts. Processes with probabilities, priorities and time. Formal Aspects of Computing, 4: 536-564, 1994.
22. th Annual Symposium on Foundations of Computer Science, pages 327-338. IEEE, 1985.