 |
 |
Valentina Castiglioni ; Daniel Gebler ; Simone Tini - SOS-based Modal Decomposition on Nondeterministic Probabilistic Processes
lmcs:3103 - Logical Methods in Computer Science, June 25, 2018, Volume 14, Issue 2 - https://doi.org/10.23638/LMCS-14(2:18)2018SOS-based Modal Decomposition on Nondeterministic Probabilistic
ProcessesArticle
We propose a method for the decomposition of modal formulae on processes with nondeterminism and probability with respect to Structural Operational Semantics. The purpose is to reduce the satisfaction problem of a formula for a process to verifying whether its subprocesses satisfy certain formulae obtained from the decomposition. To deal with the probabilistic behavior of processes, and thus with the decomposition of formulae characterizing it, we introduce a SOS-like machinery allowing for the specification of the behavior of open distribution terms. By our decomposition, we obtain (pre)congruence formats for probabilistic bisimilarity, ready similarity and similarity.
Source: arXiv.org:1701.08330
Volume: Volume 14, Issue 2
Secondary volumes: Selected Papers of the 27th International Conference on Concurrency Theory (CONCUR 2016)
Published on: June 25, 2018
Accepted on: April 9, 2018
Submitted on: January 31, 2017
Keywords: Computer Science - Logic in Computer Science, F.3.2
Classifications
Mathematics Subject Classification 20201
- 03B45 - Modal logic (including the logic of norms)
- 68Q55 - Semantics in the theory of computing
- 68Q85 - Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.)
- 68Q87 - Probability in computer science (algorithm analysis, random structures, phase transitions, etc.)
1 Document citing this article
Consultation statistics
This page has been seen 2295 times.
This article's PDF has been downloaded 420 times.