**General Actions:**

Alessandra Di Pierro, Chris Hankin, Herbert Wiklicky

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 re- lated to the concrete PTS semantics via a probabilistic abstract inter- pretation. 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.

CONCUR 2003, Lecture Notes in Computer Science 2761, pages 498-512, 2003.

Roberto M. Amadio, Denis Lugiez*(eds.)*, Springer

Concurrency Theory, 14th International Conference, Marseille, France, September 3-5, 2003, Proceedings

Roberto M. Amadio, Denis Lugiez

Concurrency Theory, 14th International Conference, Marseille, France, September 3-5, 2003, Proceedings

@incollection{processequivalence-concur2003, Author = {Di Pierro, Alessandra and Hankin, Chris and Wiklicky, Herbert}, Booktitle = {CONCUR 2003}, Doi = {10.1007/978-3-540-45187-7_33}, Editor = {Amadio, Roberto M. and Lugiez, Denis}, Isbn = {3-540-40753-7}, Note = {Concurrency Theory, 14th International Conference, Marseille, France, September 3-5, 2003, Proceedings}, Pages = {498--512}, Publisher = {Springer}, Series = {Lecture Notes in Computer Science}, Title = {Quantitative Relations and Approximate Process Equivalences}, Url = {http://www.springerlink.com/content/u4rkj4v8kpp5hyrr/}, Volume = 2761, Year = 2003}

Published

PDF Version
Powered by 1.1
Privacy
Partita IVA: 01131710376 - Copyright © 2008-2015 APICe@DISI Research Group