The interval domain: A matchmaker for aCTL and aPCTL

Electronic Notes in Theoretical Computer Science

Volumn 14, Issue , 1998, Pages 134-148

  Hutch, Michael ^a  

^a Kansas State University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PROGRAMMING LANGUAGES; COMPUTER SIMULATION; MARKOV PROCESSES; MATHEMATICAL MODELS; SEMANTICS; SYNCHRONIZATION; VECTORS;

CANONICAL PROBABILITY; LANGUAGE DESIGN; LARGE PROBABILISTIC SYSTEMS; TOOLBOX;

PROBABILISTIC LOGICS;

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

References (20)

1. Bradfield J.C. "verifying temporal Properties of Systems" 1991;Birkhaeser, Boston, Mass
2. Clarke, E.M. and E.M. Emerson, Synthesis of synchronization skeletons for branching time temporal logic, in: D. Kozen, editor, Proc. Logic of Programs, LNCS 131 (1981), springer Verlag.
3. Clarke, E.M., M.Fujita, P.C. McGeer, J. Yang, and X. Zaho, Multi-terminal binary decision diagrams: an efficient data structure of matrix representation, in: IWLS' 93: International Workshop on Logic Synthesis, Tahoe City, May 1993.
4. Escardó M.H. PCF extended with real numbers, Theoretical Computer Science. July 1996
5. Hansson H. "Time and Probability in Formula Design of Distributed Systems," Elsevier. 1994
6. Hillston, J. and M. Ribaudo, "Modeling and Simulation of Advanced Computer Systems," chapter Stochastic Process Algebras: a new approach to performance modeling, Gordon Breach, To appear.
7. Huth M., Kwisatkowskia M. Quantitative analysis and model checking, Annual IEEE Symposium on Logic in Computer Science. June 1997;111-122 IEEE Computer Society Press
8. Huth, M. and M. Kwaitkowska, Comparing CTL and PCTL on labeled Markov chains, in: Proceedings of PROCOMET '98. IFIP, June 2-6, Shelter Island, New york 1998, To appear
9. Kemeny J.G., Snell J.L. "Finite Markov Chains," Van Nostrand. 1960
10. Kozen D. Results on the propositional mucalculus, Theoretical Computer Science 27. 1983;333-354
11. Larsen K.G., Skou A. Bisimultion through probabilistic testing, Information and Computation. 94[1]. 1991;1-28
12. Moore R.E. "Interval Analysis," Prentice-Hall, Englewood Cliffs. 1996
13. Mosses P.D. Denotational semantics. van Leeuwen J. Handbook of Theoretical Computer Science. 1990;577-632 North Holland
14. Schmidt D.A. "The Structure of Typed Programming Languages," Foundations of Computing. 1994;The MIT Press
15. Scott D.S. Lattice theory, data types and semantics, in: Formal Semantics of Programming languages. 1972;66-106 Prentice-Hall
16. Stark, E. W. and S. A. Smolka, Compositional analysis of expected delays in networks of probabilistic I/O automata, in: Proceedings of the 13th Annual IEEE Symposium on Logic in Computer Science. IEEE Computer Society Press, 1998, June 21-24, Indianapolis, USA. To. Appear.
17. Stoughton A. "Fully Abstract Models of Programming Languages," Research Notes in Theoretical Computer science. Pitman/Wiley. 1988
18. Stoy J.E. "Denotational Semantics: The scott-Strachey Approach to Programming Language Theory," 1977;The MIT Press
19. Tennent R.D. "Semantics of Programming Languages," 1991;Prentice Hall
20. Vardi M. Automatic verification of probabilistic concurrent finite-state programs, In Proc. FOCS'85. IEEE. 1985;327-338