License: Creative Commons Attribution 3.0 Unported license (CC BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.CONCUR.2016.36
URN: urn:nbn:de:0030-drops-61665
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2016/6166/
Castiglioni, Valentina ;
Gebler, Daniel ;
Tini, Simone
Modal Decomposition on Nondeterministic Probabilistic Processes
Abstract
We propose a SOS-based method for decomposing modal formulae for nondeterministic probabilistic processes.
The purpose is to reduce the satisfaction problem of a formula for a process to verifying whether its subprocesses satisfy certain formulae obtained from its decomposition.
By our decomposition, we obtain (pre)congruence formats for probabilistic bisimilarity, ready similarity and similarity.
BibTeX - Entry
@InProceedings{castiglioni_et_al:LIPIcs:2016:6166,
author = {Valentina Castiglioni and Daniel Gebler and Simone Tini},
title = {{Modal Decomposition on Nondeterministic Probabilistic Processes}},
booktitle = {27th International Conference on Concurrency Theory (CONCUR 2016)},
pages = {36:1--36:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-017-0},
ISSN = {1868-8969},
year = {2016},
volume = {59},
editor = {Jos{\'e}e Desharnais and Radha Jagadeesan},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
address = {Dagstuhl, Germany},
URL = {http://drops.dagstuhl.de/opus/volltexte/2016/6166},
URN = {urn:nbn:de:0030-drops-61665},
doi = {10.4230/LIPIcs.CONCUR.2016.36},
annote = {Keywords: SOS, nondeterministic probabilistic process algebras, logical characterization, decomposition of modal formulae}
}
Keywords: |
|
SOS, nondeterministic probabilistic process algebras, logical characterization, decomposition of modal formulae |
Collection: |
|
27th International Conference on Concurrency Theory (CONCUR 2016) |
Issue Date: |
|
2016 |
Date of publication: |
|
24.08.2016 |