Abstract
We introduce a characterisation of probabilistic transition systems (PTS) in terms of linear operators on some suitably defined vector space representing the set of states. Various notions of process equivalences can then be re-formulated as abstract linear operators related to the concrete PTS semantics via a probabilistic abstract interpretation. These process equivalences can be turned into corresponding approximate notions by identifying processes whose abstract operators “differ” by a given quantity, which can be calculated as the norm of the difference operator. We argue that this number can be given a statistical interpretation in terms of the tests needed to distinguish two behaviours.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Aldini, A., Bravetti, M., Gorrieri, R.: A process algebraic approach for the analysis of probabilistic non-interference. Journal of Computer Security (2003) (to appear)
Bergstra, J.A., Ponse, A., Smolka, S.A. (eds.): Handbook of Process Algebra. Elsevier Science, Amsterdam (2001)
Böttcher, A., Silbermann, B.: Introduction to Large Truncated Toeplitz Matrices. Springer, New York (1999)
Campbell, S.L., Meyer, D.: Generalized Inverse of Linear Transformations. Constable and Company, London (1979)
Cousot, P., Cousot, R.: Abstract Interpretation: A Unified Lattice Model for Static Analysis of Programs by Construction or Approximation of Fixpoints. In: Proceedings of POPL 1977, Los Angeles, pp. 238–252 (1977)
Cousot, P., Cousot, R.: Systematic Design of Program Analysis Frameworks. In: Proceedings of POPL 1979, San Antonio, Texas, pp. 269–282 (1979)
Cousot, P., Cousot, R.: Abstract Interpretation and Applications to Logic Programs. Journal of Logic Programming 13(2-3), 103–180 (1992)
Dams, D., Gerth, R., Grumberg, O.: Abstract interpretation of reactive systems. ACM Transactions on Programming Languages and Systems 19(2), 253–291 (1997)
Desharnais, J., Jagadeesan, R., Gupta, V., Panangaden, P.: The metric analogue of weak bisimulation for probabilistic processes. In: Proceedings of LICS 2002, Denmark, July 22- 25, pp. 22–25. IEEE, Los Alamitos (2002)
Di Pierro, A., Hankin, C., Wiklicky, H.: Approximate confinement under uniform attacks. In: Hermenegildo, M.V., Puebla, G. (eds.) SAS 2002. LNCS, vol. 2477, p. 310. Springer, Heidelberg (2002)
Di Pierro, A., Hankin, C., Wiklicky, H.: Approximate non-interference. In: Proceedings of CSFW 2002, Cape Breton, June 24- 26, pp. 24–26. IEEE, Los Alamitos (2002)
Di Pierro, A., Hankin, C., Wiklicky, H.: Approximate non-interference. Journal of Computer Security, WITS 2002 Issue (2003) (to appear)
Di Pierro, A., Wiklicky, H.: Concurrent Constraint Programming: Towards Probabilistic Abstract Interpretation. In: Proceedings of PPDP 2000, Montréal, Canada, pp. 127–138. ACM, New York (2000)
Di Pierro, A., Wiklicky, H.: Measuring the precision of abstract interpretations. In: Lau, K.-K. (ed.) LOPSTR 2000. LNCS, vol. 2042, pp. 147–164. Springer, Heidelberg (2001)
Di Pierro, A., Wiklicky, H.: A C*-algebraic approach to the operational semantics of programming languages (2003) (in preparation)
Giacalone, A., Jou, C.-C., Smolka, S.A.: Algebraic reasoning for probabilistic concurrent systems. In: Proceedings of the IFIP WG 2.2/2.3 Working Conference on Programming Concepts and Methods, pp. 443–458. North-Holland, Amsterdam (1990)
Godsil, C., Royle, G.: Algebraic Graph Theory. Graduate Texts in Mathematics, vol. 207. Springer, New York (2001)
Greub, W.H.: Linear Algebra. Grundlehren der mathematischen Wissenschaften, vol. 97. Springer, New York (1967)
Jonsson, B., Yi, W., Larsen, K.G.: Probabilistic Extensions of Process Algebras. ch. 11, pp. 685–710. Elsevier Science, Amsterdam (2001) see [2]
Kozen, D.: Semantics for probabilistic programs. Journal of Computer and System Sciences 22, 328–350 (1981)
Larsen, K.G., Skou, A.: Bisimulation through probabilistic testing. Information and Computation 94, 1–28 (1991)
Milner, R.: A Calculus of Communication Systems. LNCS, vol. 92. Springer, Heidelberg (1980)
Mohar, B., Woess, W.: A survey on spectra of infinite graphs. Bulletin of the London Mathematical Society 21, 209–234 (1988)
Monniaux, D.: Abstract interpretation of probabilistic semantics. In: Palsberg, J. (ed.) SAS 2000. LNCS, vol. 1824, pp. 322–340. Springer, Heidelberg (2000)
Nielson, F., Riis Nielson, H., Hankin, C.: Principles of Program Analysis. Springer, Berlin (1999)
Smolka, S.A., van Glabbeek, R.J., Steffen, B.: Reactive, Generative and Stratified Models of Probabilistic Processes. Information and Computation 121, 59–80 (1995)
Schmidt, D.A.: Binary relations for abstraction and refinement. In: Workshop on Refinement and Abstraction, Amagasaki, Japan (November 1999)
Shao, J.: Mathematical Statistics. Springer Texts in Statistics. Springer, New York (1999)
Sontag, E.D.: Mathematical Control Theory: Deterministic Finite Dimensional Systems. Texts in Applied Mathematics, vol. 6. Springer, Heidelberg (1990)
van Breugel, F., Worrell, J.: Towards quantitative verification of probabilistic transition systems. In: Orejas, F., Spirakis, P.G., van Leeuwen, J. (eds.) ICALP 2001. LNCS, vol. 2076, pp. 421–432. Springer, Heidelberg (2001)
van Glabbeek, R.J.: The Linear Time – Branching Time Spectrum I. The Semantics of Concrete, Sequential Processes. ch. 1, pp. 3–99. Elsevier Science, Amsterdam (2001) see [2]
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Di Pierro, A., Hankin, C., Wiklicky, H. (2003). Quantitative Relations and Approximate Process Equivalences. In: Amadio, R., Lugiez, D. (eds) CONCUR 2003 - Concurrency Theory. CONCUR 2003. Lecture Notes in Computer Science, vol 2761. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-45187-7_33
Download citation
DOI: https://doi.org/10.1007/978-3-540-45187-7_33
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40753-9
Online ISBN: 978-3-540-45187-7
eBook Packages: Springer Book Archive