Access the full text.
Sign up today, get DeepDyve free for 14 days.
Loading next page...
/lp/association-for-computing-machinery/probabilistic-bisimulation-as-a-congruence-zpAxiF011v
References (34)
-
R. Milner (1993)
The Polyadic π-Calculus: a Tutorial -
J. Groote, F. Vaandrager (1992)
Structured Operational Semantics and Bisimulation as a CongruenceInf. Comput., 100
-
A. Giacalone, C. Jou, S. Smolka (1990)
Algebraic Reasoning for Probabilistic Concurrent Systems -
F. Bartels (2002)
GSOS for Probabilistic Transition Systems -
Article 9, Publication date: February 2009 -
R. Glabbeek, S. Smolka, B. Steffen (1990)
Reactive, generative, and stratified models of probabilistic processes[1990] Proceedings. Fifth Annual IEEE Symposium on Logic in Computer Science
-
S. Tini (2004)
Rule formats for compositional non-interference propertiesJ. Log. Algebraic Methods Program., 60-61
-
R. Lanotte, S. Tini (2005)
Probabilistic Congruence for Generative Semistochastic ProcessesLecture Notes in Computer Science, 3441
-
K. Larsen, A. Skou (1991)
Bisimulation through Probabilistic TestingInf. Comput., 94
-
(2006)
Received March -
A. Aldini, M. Bravetti, R. Gorrieri (2011)
A Process Algebraic Approach for the Analysis of Probabilistic Non-interference -
J. Groote (1993)
Transition System Specifications with Negative PremisesTheor. Comput. Sci., 118
-
J. Baeten, J. Bergstra, S. Smolka (1995)
Axiomatizing Probabilistic Processes: ACP with Generative ProbabilitiesInf. Comput., 121
-
R. Simone (1985)
Higher-Level Synchronising Devices in Meije-SCCSTheor. Comput. Sci., 37
-
D. Turi, G. Plotkin (1997)
Towards a mathematical operational semanticsProceedings of Twelfth Annual IEEE Symposium on Logic in Computer Science
-
I. Ulidowski, Shoji Yuen (2004)
Process languages with discrete relative time based on the Ordered SOS format and rooted eager bisimulationJ. Log. Algebraic Methods Program., 60-61
-
(2009)
ACM Transactions on Computational Logic -
B. Jonsson, W. Yi, K. Larsen (2001)
Probabilistic Extensions of Process Algebras -
A. Aldini, M. Bravetti, R. Gorrieri (2004)
A process-algebraic approach for the analysis of probabilistic noninterferenceJ. Comput. Secur., 12
-
S. Wu, S. Smolka, E. Stark (1994)
Composition and Behaviors of Probabilistic I/O Automata -
M. Bravetti, A. Aldini (2003)
Discrete time generative-reactive probabilistic processes with different advancing speedsTheor. Comput. Sci., 290
-
P. D’Argenio, H. Hermanns, J. Katoen (1998)
On Generative Parallel Composition -
G. Plotkin (2004)
A structural approach to operational semanticsJ. Log. Algebraic Methods Program., 60-61
-
R. Glabbeek (1996)
The meaning of negative premises in transition system specifications IIJ. Log. Algebraic Methods Program., 60-61
-
C. Baier, H. Hermanns (1997)
Weak Bisimulation for Fully Probabilistic Processes -
F. Bartels (2004)
On Generalised Coinduction and Probabilistic Specification Formats -
Since these arguments hold for all 1 ≤ l ≤ n, it follows that μ R ( f ( − → t ), a, S) = q, as required -
E. Stark, S. Smolka (2000)
A complete axiom system for finite-state probabilistic processes -
L. Aceto, W. Fokkink, C. Verhoef (1999)
Structural Operational Semantics -
R. Lanotte, S. Tini (2005)
Probabilistic Congruence for Semistochastic Generative Processes -
Áööö Íðððóû××׸áááò (2002)
Çöööööö Ëçë Èöó Blockin Blockin×× Ääòòùùùù× Óö Ööò Blockinòò Òò Ö ××ñùððøøóò× -
B. Bloom, S. Istrail, A. Meyer (1988)
Bisimulation can't be traced -
S. Kleene (1951)
Representation of Events in Nerve Nets and Finite Automata -
S. Tini (2003)
Rule Formats for Non Interference
- Publisher
- Association for Computing Machinery
- Copyright
- Copyright © 2009 by ACM Inc.
- ISSN
- 1529-3785
- DOI
- 10.1145/1462179.1462181
- Publisher site
- See Article on Publisher Site
Abstract
We propose both an SOS transition rule format for the generative model of probabilistic processes, and an SOS transition rule format for the reactive model of the probabilistic processes. Our rule formats guarantee that probabilistic bisimulation is a congruence with respect to process algebra operations. Moreover, our rule format for generative process algebras guarantees that the probability of the moves of a given process, if there are any, sum up to 1, and the rule format for reactive process algebras guarantees that the probability of the moves of a given process labeled with the same action, if there are any, sum up to 1. We show that most operations of the probabilistic process algebras studied in the literature are captured by our formats, which, therefore, have practical applications.
Journal
ACM Transactions on Computational Logic (TOCL) – Association for Computing Machinery
Published: Feb 1, 2009