Probabilistic congruence for semistochastic generative processes

Lecture Notes in Computer Science

Volumn 3441, Issue , 2005, Pages 63-78

  Lanotte, Ruggero ^a   Tini, Simone ^a  

^a UNIVERSITY OF INSUBRIA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA; COMPUTER SIMULATION; DATA STRUCTURES; PROBABILISTIC LOGICS; SOFTWARE ENGINEERING;

PROBABILISTIC BISIMULATION; PROBABILISTIC CONGRUENCE; SEMISTOCHASTIC GENERATIVE PROCESSES;

STOCHASTIC PROGRAMMING;

EID: 24644509896     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/978-3-540-31982-5_4     Document Type: Conference Paper

References (21)

1. L. Aceto, W. J. Fokkink, and C. Verhoef: Structural Operational Semantics. Handbook of Process Algebra, Elsevier, Amsterdam, 2001, 197-292.
2. A. Aldini, M. Bravetti, and R. Gorrieri: A Process-algebraic Approach for the Analysis of Probabilistic Non-interference. J. Comput. Secur. 12, 2004, 191-245.
3. J. C. M. Baeten, J. A. Bergstra, and S. A. Smolka: Axiomatizing Probabilistic Processes: ACP with Generative Probabilities. Inf. Comput. 121, 1995, 234-255.
4. J. C. M. Baeten and C. Verhoef: A Congruence Theorem for Structured Operational Semantics with Predicates. Proc. Concurrency Theory, LNCS 715, 1993.
5. C. Baier and H. Hermanns: Weak Bisimulation for Fully Probabilistic Processes. Proc. Computer Aided Verification, LNCS 1254, 1997, 119-130.
6. F. Bartels: GSOS for Probabilistic Transition Systems. Proc. Coalgebraic Methods in Computer Science, ENTCS 65, 2002.
7. B. Bloom, S. Istrail, and A. Meyer: Bisimulation Can't Be Traced. J. Assoc. Comput. Mach. 42, 1995, 232-268.
8. M. Bravetti and A. Aldini: Discrete Time Generative-reactive Probabilistic Processes with Different Advancing Speeds. Theor. Comput. Sci. 290, 2003, 355-406.
9. P. R. D'Argenio, H. Hermanns, and J. P. Katoen: On Generative Parallel Composition. Proc. Probabilistic Methods in Verification, ENTCS 22, 1999.
10. A. Giacalone, C.C. Jou, and S.A. Smolka: Algebraic Reasoning for Probabilistic Concurrent Systems. IFIP Work. Conf. on Progr., Concepts and Methods, 1990.
11. R. J. van Glabbeek, S. A. Smolka, and B. Steffen: Reactive, Generative and Stratified Models of Probabilistic Processes. Inf. Comput. 121, 1995, 59-80.
12. J. F. Groote and F. Vaandrager: Structured Operational Semantics and Bisimulation as a Congruence. Inf. Comput. 100, 1992, 202-260.
13. B. Jonsson, K. L. Larsen, and W. Yi: Probabilistic Extensions of Process Algebras. Handbook of Process Algebra, Elsevier, Amsterdam, 2001.
14. G. Plotkin: A Structural Approach to Operational Semantics. Technical report DAIMI FN-19, University of Aarhus, 1981.
15. G. Plotkin: A Structural Approach to Operational Semantics. J. Log. Algebr. Program. 60-61, 2004, 17-139.
16. R. de Simone: Higher-level Synchronizing Devices in Meije-SCCS. Theor. Comput. Sci. 37, 1985, 245-267.
17. S. Tini: Rule Formats for Non-Interference. Proc. European Symp. on Programming, LNCS 2618, 2003, 129-143.
18. S. Tini: Rule Formats for Compositional non Interference Properties. J. Log. Algebr. Program. 60-61, 2004, 353-400.
19. I. Ulidowski and I. Phillips: Ordered SOS Process Languages for Branching and Eager Bisimulations. Inf. Comput. 178, 2002, 180-213.
20. C. Verhoef: A Congruence Theorem for Structural Operational Semantics with Predicates and Negative Premises. Nord. J. Comput. 2, 1995, 274-302.
21. S. H. Wu, S. A. Smolka, and E. W. Stark: Composition and Behaviors of Probabilistic I/O Automata. Theor. Comput. Sci. 176, 1997, 1-38.