Quantitative relations and approximate process equivalences

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

Volumn 2761, Issue , 2003, Pages 508-522

  Di Pierro, Alessandra ^a   Hankin, Chris ^b   Wiklicky, Herbert ^b  

^a UNIVERSITY OF PISA   (Italy)

^b IMPERIAL COLLEGE LONDON   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

SEMANTICS; VECTOR SPACES;

ABSTRACT OPERATOR; DIFFERENCE OPERATORS; LINEAR OPERATORS; PROBABILISTIC ABSTRACT INTERPRETATION; PROBABILISTIC TRANSITION SYSTEM; PROCESS EQUIVALENCE; QUANTITATIVE RELATIONS; STATISTICAL INTERPRETATION;

MATHEMATICAL OPERATORS;

EID: 35248857469     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-45187-7_33     Document Type: Article

References (31)

1. A. Aldini, M. Bravetti, and R. Gorrieri. A process algebraic approach for the analysis of probabilistic non-interference. Journal of Computer Security, 2003. To appear.
2. J.A. Bergstra, A. Ponse, and S.A. Smolka, editors. Handbook of Process Algebra. Elsevier Science, Amsterdam, 2001.
3. A. Böttcher and B. Silbermann. Introduction to Large Truncated Toeplitz Matrices. Springer Verlag, New York, 1999.
4. S.L. Campbell and D. Meyer. Generalized Inverse of Linear Transformations. Constable and Company, London, 1979.
5. P. Cousot and R. Cousot. Abstract Interpretation: A Unified Lattice Model for Static Analysis of Programs by Construction or Approximation of Fixpoints. In Proceedings of POPL'77, pages 238-252, Los Angeles, 1977.
6. P. Cousot and R. Cousot. Systematic Design of Program Analysis Frameworks. In Proceedings of POPL '79, pages 269-282, San Antonio, Texas, 1979.
7. P. Cousot and R. Cousot. Abstract Interpretation and Applications to Logic Programs. Journal of Logic Programming, 13(2-3):103-180, July 1992.
8. D. Dams, R. Gerth, and O. Grumberg. Abstract interpretation of reactive systems. ACM Transactions on Programming Languages and Systems, 19(2):253-291, 1997.
9. J. Desharnais, R. Jagadeesan, V. Gupta, and P. Panangaden. The metric analogue of weak bisimulation for probabilistic processes. In Proceedings of LICS'02, pages 413-422, Copenhagen, Denmark, 22-25 July 2002. IEEE.
10. A. Di Pierro, C. Hankin, and H. Wiklicky. Approximate confinement under uniform attacks. In Proceedings of SAS'02, volume 2477 of Lecture Notes in Computer Science. Springer Verlag, 2002.
11. A. Di Pierro, C. Hankin, and H. Wiklicky. Approximate non-interference. In Proceedings of CSFW'02, pages 3-17, Cape Breton, 24-26 June 2002. IEEE.
12. A. Di Pierro, C. Hankin, and H. Wiklicky. Approximate non-interference. Journal of Computer Security (WITS '02 Issue), 2003. To appear.
13. A. Di Pierro and H. Wiklicky. Concurrent Constraint Programming: Towards Probabilistic Abstract Interpretation. In Proceedings of PPDP'00, pages 127-138, Montréal, Canada, 2000. ACM.
14. A. Di Pierro and H. Wiklicky. Measuring the precision of abstract interpretations. In Proceedings of LOPSTR'00, volume 2042 of Lecture Notes in Computer Science, pages 147-164. Springer Verlag, 2001.
15. A. Di Pierro and H. Wiklicky. A C*-algebraic approach to the operational semantics of programming languages. In preparation, 2003.
16. A. Giacalone, C.-C. Jou, and S.A. Smolka. Algebraic reasoning for probabilistic concurrent systems. In Proceedings of the IFIP WG 2.2/2.3 Working Conference on Programming Concepts and Methods, pages 443-458. North-Holland, 1990.
17. C. Godsil and G. Royle. Algebraic Graph Theory, volume 207 of Graduate Texts in Mathematics. Springer Verlag, New York - Heidelberg - Berlin, 2001.
18. W.H. Greub. Linear Algebra, volume 97 of Grundlehren der mathematischen Wissenschaften. Springer Verlag, New York, third edition, 1967.
19. B. Jonsson, W. Yi, and K.G. Larsen. Probabilistic Extensions of Process Algebras, chapter 11, pages 685-710. Elsevier Science, Amsterdam, 2001. see [2].
20. D. Kozen. Semantics for probabilistic programs. Journal of Computer and System Sciences, 22:328-350, 1981.
21. K.G. Larsen and A. Skou. Bisimulation through probabilistic testing. Information and Computation, 94:1-28, 1991.
22. R. Milner. A Calculus of Communicating Systems, volume 92 of Lecture Notes in Computer Science. Springer-Verlag, Berlin - New York, 1980.
23. B. Mohar and W. Woess. A survey on spectra of infinite graphs. Bulletin of the London Mathematical Society, 21:209-234, 1988.
24. D. Monniaux. Abstract interpretation of probabilistic semantics. In Proceedings of SAS'00, volume 1824 of Lecture Notes in Computer Science. Springer Verlag, 2000.
25. F. Niebon, H. Riis Nielson, and C. Hankin. Principles of Program Analysis. Springer Verlag, Berlin - Heidelberg, 1999.
26. S.A. Smolka R.J. van Glabbeek and B. Steffen. Reactive, Generative and Stratified Models of Probabilistic Processes. Information and Computation, 121:59-80, 1995.
27. D.A. Schmidt. Binary relations for abstraction and refinement. In Workshop on Refinement and Abstraction, Amagasaki, Japan, November 1999.
28. J. Shao. Mathematical Statistics. Springer Texts in Statistics. Springer Verlag, New York - Berlin - Heidelberg, 1999.
29. E.D. Sontag. Mathematical Control Theory: Deterministic Finite Dimensional Systems, volume 6 of Texts in Applied Mathematics. Springer Verlag, 1990.
30. F. van Breugel and J. Worrell. Towards quantitative verification of probabilistic transition systems. In Proceedings of ICALP'01, volume 2076 of Lecture Notes in Computer Science, pages 421-432. Springer Verlag, 2001.
31. R.J. van Glabbeek. The Linear Time - Branching Time Spectrum I. The Semantics of Concrete, Sequential Processes, chapter 1, pages 3-99. Elsevier Science, Amsterdam, 2001. see [2].