Compositionality of Probabilistic Hennessy-Milner Logic through Structural Operational Semantics

被引：0

作者：

Gebler, Daniel ^{[1
]}

Fokkink, Wan ^{[1
]}

机构：

[1] Vrije Univ Amsterdam, Amsterdam, Netherlands

来源：

CONCUR 2012 - CONCURRENCY THEORY | 2012年 / 7454卷

关键词：

BISIMULATION;

D O I：

暂无

中图分类号：

TP31 [计算机软件];

学科分类号：

081202 ; 0835 ;

摘要：

We present a method to decompose HML formulae for reactive probabilistic processes. This gives rise to a compositional modal proof system for the satisfaction relation of probabilistic process algebras. The satisfaction problem of a probabilistic HML formula for a process term is reduced to the question of whether its subterms satisfy a derived formula obtained via the operational semantics.

引用

页码：395 / 409

页数：15

共 29 条

[1] Aceto L., 2001, Handbook of Process Algebra, P197, DOI [10.1016/b978-044482830-9/50021-7, DOI 10.1016/B978-044482830-9/50021-7]
[2] Aldini A., 2004, Journal of Computer Security, V12, P191
[3] [Anonymous], 2001, Handbook of Process Algebra, DOI DOI 10.1016/B978-044482830-9/50029-1
[4] Bacci Giorgio, 2012, Coalgebraic Methods in Computer Science. 11th International Workshop, CMCS 2012 Colocated with ETAPS 2012. Revised Selected Papers, P71, DOI 10.1007/978-3-642-32784-1_5
[5] AXIOMATIZING PROBABILISTIC PROCESSES - ACP WITH GENERATIVE PROBABILITIES
BAETEN, JCM
BERGSTRA, JA
SMOLKA, SA
[J]. INFORMATION AND COMPUTATION, 1995, 121 (02) : 234 - 255
[6] Bartels F., 2002, Electronic Notes in Theoretical Computer Science, V65, DOI 10.1016/S1571-0661(04)80358-X
[7] Bloom B., 2004, ACM Transactions on Computational Logic, V5, P26, DOI 10.1145/963927.963929
[8] BISIMULATION CANT BE TRACED
BLOOM, B
ISTRAIL, SN
MEYER, AR
[J]. JOURNAL OF THE ASSOCIATION FOR COMPUTING MACHINERY, 1995, 42 (01): : 232 - 268
[9] Cardelli L, 2011, LECT NOTES COMPUT SC, V6756, P380, DOI 10.1007/978-3-642-22012-8_30
[10] Clark K. L., 1978, Logic and data bases, P293

← 1 2 3 →