Compositional methods for probabilistic systems

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

Volumn 2154, Issue , 2001, Pages 351-365

  De Alfaro, Luca ^a   Henzinger, Thomas A ^a   Jhala, Ranjit ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

MODEL CHECKING; RANDOM PROCESSES; SEMANTICS; STOCHASTIC SYSTEMS;

COMPOSITIONAL METHOD; COMPOSITIONAL MODELING; COMPOSITIONALITY; HIDDEN STATE; PROBABILISTIC CHOICES; PROBABILISTIC SYSTEMS; SCOPING;

PROBABILITY DISTRIBUTIONS;

EID: 84944060609     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44685-0_24     Document Type: Conference Paper

References (15)

1. [AH99] R. Alur and T.A. Henzinger. Reactive modules. Formal Methods in System Design 15:7–48, 1999.
2. [AL95] M. Abadi and L. Lamport. Conjoining specifications. ACM Trans. Programming Languages and Systems, 17:507–534, 1995.
3. A. Bianco and L. de Alfaro. Model checking of probabilistic and nondeterministic systems. In Foundations of Software Technology and Theoretical Computer Science, volume 1026 of Lect. Notes in Comp. Sci., pages 499–513. Springer-Verlag, 1995.
4. L. de Alfaro. Stochastic transition systems. In Concurrency Theory, volume 1466 of Lect. Notes in Comp. Sci., pages 423–438. Springer-Verlag, 1998.
5. L. de Alfaro, M. Kwiatkowska, G. Norman, D. Parker, and R. Segala. Symbolic model checking of concurrent probabilistic processes using MTBDDs and the Kronecker representation. In Tools and Algorithms for the Construction and Analysis of Systems, volume 1785 of Lect. Notes in Comp. Sci., pages 395–410. Springer-Verlag, 2000.
6. C. Derman. Finite State Markovian Decision Processes. Academic Press, 1970.
7. D.L. Dill. Trace Theory for Automatic Hierarchical Verification of Speedindependent Circuits. The MIT Press, 1989.
8. [JL91] B. Jonsson and K.G. Larsen. Specification and refinement of probabilistic processes. In Proc. Symp. Logic in Computer Science, pages 266–277. IEEE Computer Society Press, 1991.
9. L. Lamport. Specifying concurrent program modules. ACM Trans. Progamming Languages and Systems, 5:190–222, 1993.
10. N.A. Lynch. Distributed Algorithms. Morgan-Kaufmann, 1996.
11. [MC81] J. Misra and K.M. Chandy. Proofs of networks of processes. IEEE Trans. Software Engineering, SE-7:417–426, 1981.
12. K.L. McMillan. A compositional rule for hardware design refinement. In Computer-Aided Verification, volume 1254 of Lect. Notes in Comp. Sci., pages 24–35. Springer-Verlag, 1997.
13. R. Segala. Modeling and Verification of Randomized Distributed Real- Time Systems. PhD thesis, MIT, 1995. Technical Report MIT/LCS/TR- 676.
14. [SL94] R. Segala and N.A. Lynch. Probabilistic simulations for probabilistic processes. In Concurrency Theory, volume 836 of Lect. Notes in Comp. Sci., pages 481–496. Springer-Verlag, 1994.
15. M.Y. Vardi. Automatic verification of probabilistic concurrent finitestate systems. In Proc. Symp. Foundations of Computer Science, pages 327–338. IEEE Computer Society Press, 1985