On the semantic foundations of probabilistic synchronous reactive programs

Electronic Notes in Theoretical Computer Science

Volumn 22, Issue , 1999, Pages 3-28

  Baier, Christel ^a   Clarke, Edmund M ^b   Hartonas Garmhausen, Vasiliki ^b  

^a UNIVERSITY OF MANNHEIM   (Germany)

^b Carnegie Mellon University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTER SIMULATION; FORMAL LOGIC; FUNCTIONS; GRAPHIC METHODS; MARKOV PROCESSES; MATHEMATICAL MODELS; PROBABILITY;

OPERATIONAL SEMANTICS; PROBABILISITIC SYSTEMS; PROBABILISTIC SYNCHRONOUS REACTIVE PROGRAMS; SEMANTIC FOUNDATIONS;

SEMANTICS;

EID: 0008441783     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/S1571-0661(05)80594-8     Document Type: Conference Paper

References (21)

1. Aziz A., Singhal V., Balarin F., Brayton R. A Sangiovanni-Vincentelli: It usually works: The Temporal Logic of Stochastic Systems. Proc. CAV′95, LNCS. Vol. 939:1995;155-165
2. Bahar I., Frohm E., Gaona C., Hachtel G., Macii E., Padro A., Somenzi F. Algebraic Decision Diagrams and their Applications. Proc. ICCAD. 1993;188-191
3. Baier C., Clarke E., Hartonas-Garmhausen V., Kwiatkowska M., Ryan M. Symbolic Model Checking for Probabilistic Processes. Proc. ICALP′97, Lecture Notes in Computer Science 1256. 1997;430-440
4. Baier C., Majster-Cederbaum M. How to Interpret and Establish Consistency Results for Semantics of Concurrent Programming Languages. Fundamenta Informaticae. Vol. 29:(No. 3):1997;225-256
5. Campos S. A Quantitative Approach to the Formal Verification of Real-Time Systems. Ph.D. Thesis, Carnegie Mellon University. 1996
6. Christoff L., Christoff I. Reasoning about Safety and Liveness Properties for Probabilistic Processes, Proc. 12th Conference on Foundations of Software Technology and Theoretical Computer Science. LNCS. Vol. 652:1992;342-355
7. Clarke E., Emerson E.A. Design and Synthesis of Synchronization Skeletons from Branching Time Temporal Logic, Proc. Workshop on Logics of Programs. LNCS. Vol. 131:1981;52-71
8. Clarke E., Emerson A., Sistla P. Automatic Verification of Finite-State Concurrent Systems using Temporal Logic Specifications, ACM Trans. Programming Languages and Systems. 1:(2):1986
9. Clarke E., Fujita M., McGeer P., Yang J., Zhao X. Multi-Terminal Binary Decision Diagrams: An Efficient Data Structure for Matrix Representation, In IWLS′93. 1993;International Workshop on Logic Synthesis, Tahoe City
10. Clarke E., Grumberg O., Long D. Model Checking and Abstraction. ACM Transactions on Programming Languages and Systems. Vol. 16:1994;1512-1542
11. Courcoubetis C., Yannakakis M. Verifying Temporal Properties of Finite-State Probabilistic Programs. Proc. FOCS′88. 1988;338-345
12. Courcoubetis C., Yannakakis M. The Complexity of Probabilistic Verification. J. ACM. 42:(4):1995;857-907
13. Feller W. An Introduction to Probability Theory and its Applications. 1968;Wiley, Ney York
14. Hachtel G., Macii E., Padro A., Somenzi F. Probabilistic Analysis of Large Finite State Machines, Proc. ACM/IEEE DAC′94. 1994;270-275
15. Halmos P. Measure Theory. 1950;Springer-Verlag
16. Hansson H., Jonsson B. A Logic for Reasoning about Time and Probability. Formal Aspects of Computing. Vol. 6:1994;512-535
17. Hartonas-Garmhausen V. Probabilistic Symbolic Model Checking with Engineering Models and Applications. Ph.D. Thesis, Carnegie Mellon University. 1998
18. Hartonas-Garmhausen V., Campos S., Clarke E. ProbVerus: Probabilistic Symbolic Model Checking. Proc. ARTS′99, LNCS 1601. 1999;96-110
19. Larsen K., Skou A. Bisimulation through Probabilistic Testing. Information and Computation. Vol. 94:1991;1-28
20. Plotkin G. A Structural Approach to Operational Semantics, Report DAIMI FN-19. September 1981;Aarhus University
21. Vardi M., Wolper P. An Automata-Theoretic Approach to Automatic Program Verification. Proc. LICS′86. 1986;332-344