Probabilistic duration automata for analyzing real-time systems

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

Volumn 1055, Issue , 1996, Pages 369-390

  Moser, Louise E ^a   Melliar Smith, P M ^a  

^a University of California   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; CLOCKS; DECODING; INTERACTIVE COMPUTER SYSTEMS; PROBABILITY; PROBABILITY DENSITY FUNCTION;

FOUR-PHASE; HANDSHAKING PROTOCOL; INPUT/OUTPUT; NOVEL METHODOLOGY; PROBABILISTIC DURATION; PROBABILITY DENSITY FUNCTIONS (PDFS); REAL TIME BEHAVIOR; TIMING CONSTRAINTS;

REAL TIME SYSTEMS;

EID: 84958763211     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-61042-1_55     Document Type: Conference Paper

References (18)

1. R. Alur, C. Courcoubetis and D. Dill, “Verifying automata specifications of probabilistic real-time systems,” Proceedings of the REX Workshop on Real-Time: Theory in Practice, Mook, The Netherlands (June 1991), Lecture Notes in Computer Science 600, Springer-Verlag, pp. 28-44.
2. R. Alur and D. Dill, “Automata for modelling real-time systems,” Proceedings of the 17th International Colloquium on Automata, Languages, and Programming, Warwick, England (July 1990), Lecture Notes in Computer Science 443, Springer-Verlag, pp. 322-335.
3. C. Courcoubetis and M. Yannakakis, “The complexity of probabilistic verification,” Journal of the Association for Computing Machinery 42, 4 (July 1995), pp. 857-907.
4. Y. A. Feldman, “A decidable propositional dynamic logic with explicit probabilities,” Information and Control 63 (1984), pp. 11-38.
5. H. Hansson and B. Jonsson, “A logic for reasoning about time and rehability,” Formal Aspects of Computing 6, 5 (1994), pp. 512-535.
6. C. Ho-Stuaxt, H. Zedan and M. Fang, “Automated support for the forreal specification and design of real-time systems,” Proceedings of the Nineteenth EUROMICRO Symposium on Microprocessing and Microprogramruing, Barcelona, Spain (September 1993), pp. 79-86.
7. C. M. Huang, S. W. Lee and J. M. Hsu, “Probabilistic timed protocol verification for the extended state transition model,” Proceedings of the 1994 International Conference on Parallel and Distributed Systems, Hsinchu, Taiwan (December 1994), pp. 432-437.
8. S. Jahanian and A. K. Mok, “Modechart: A specification language for realtime systems,” IEEE Transactions on Software Engineering 20, 11 (November 1994), pp. 933-947.
9. B. Jonsson and K. G. Laxsen, “Specification and refinement of probabilistic processes,” Proceedings of the 6th IEEE Annual Symposium on Logic in Computer Science, Amsterdam, The Netherlands (July 1991), pp. 266-277.
10. D. Kozen, “Probabilistic PDL,” Journal of Computer and System Sciences 30 (1985), pp. 162-178.
11. Z. Liu, A. P. Ravn, E. V. Sorensen and C. Zhou, “A probabilistic duration calculus,” Proceedings of the Second International Workshop on Responsive Computer Systems, Saitama, Japan (October 1992), pp. 14-27.
12. N. Lynch, I. Saias and R. Segala, “Proving time bounds for randomized distributed algorithms,” Proceedings of the Thirteenth Annual A CM Symposium on Principles of Distributed Computing, Los Angeles, CA (August 1994), pp. 314-323.
13. L. E. Moser, Y. S. Ramakrishna, G. Kutty, P. M. MeUiar-Smith and L. K. Dillon, “A graphical environment for design of concurrent real-time systems,” Technical Report 95-18, Department of Electrical and Computer Engineering, University of California, Santa Barbara.
14. Y. S. Raanakrishna, L. K. Dillon, L. E. Moser, P. M. Melliar-Smith and G. Kutty, “A real-time interval logic and its decision procedure,” Proceedings of the Thirteenth Conference on Foundations of Software Technology and Theoretical Computer Science, Bombay, India (December 1993), Lecture Notes in Computer Science 761, Springer-Verlag, pp. 173-192.
15. A. C. Shaw, “Communicating real-time state machines,” 1EEE Transactions on Software Engineering 18, 9 (September 1992), pp. 805-816.
16. M. Y. Vaxdi and P. Wolper, “An automata-theoretic approach to automatic program verification,” Proceedings of the Symposium on Logic in Computer Science,” Cambridge, England (June 1986), pp. 322-331.
17. W. Whitt, “Continuity of generalized semi-Markov processes,” Mathematics of Operations Research 5, 4 (November 1980), pp. 494-501.
18. S. H. Wu, S. A. Smolka and E. W. Stark, “Composition and behaviors of probabilistic I/O automata,” Proceedings of the 5th International Conference on Concurrency Theory, Uppsala, Sweden (August 1994), pp. 513-528.