loading
Documents

Research.Publish.Connect.

Paper

Authors: Norihiro Kamide and Yuki Yano

Affiliation: Teikyo University, Faculty of Science and Engineering, Department of Information and Electronic Engineering, Toyosatodai

ISBN: 978-989-758-350-6

Keyword(s): Computation Tree Logic, Probabilistic Computation Tree Logic, Hierarchical Computation Tree Logic, Embedding Theorem, Relative Decidability.

Abstract: This study proposes a hierarchical probabilistic computation tree logic, HpCTL, which is an extension of the standard probabilistic computation tree logic pCTL, as a theoretical basis for hierarchical probabilistic CTL model checking. Hierarchical probabilistic model checking is a new paradigm that can appropriately verify hierarchical randomized (or stochastic) systems. Furthermore, a probability-measure-independent translation from HpCTL into pCTL is defined, and a theorem for embedding HpCTL into pCTL is proved using this translation. Finally, the relative decidability of HpCTL with respect to pCTL is proved using this embedding theorem. These embedding and relative decidability results allow us to reuse the standard pCTL-based probabilistic model checking algorithms to verify hierarchical randomized systems that can be described using HpCTL.

PDF ImageFull Text

Download
CC BY-NC-ND 4.0

Sign In Guest: Register as new SciTePress user now for free.

Sign In SciTePress user: please login.

PDF ImageMy Papers

You are not signed in, therefore limits apply to your IP address 34.231.247.139

In the current month:
Recent papers: 100 available of 100 total
2+ years older papers: 200 available of 200 total

Paper citation in several formats:
Kamide, N. and Yano, Y. (2019). Towards Hierarchical Probabilistic CTL Model Checking: Theoretical Foundations.In Proceedings of the 11th International Conference on Agents and Artificial Intelligence - Volume 2: ICAART, ISBN 978-989-758-350-6, pages 762-769. DOI: 10.5220/0007456507620769

@conference{icaart19,
author={Norihiro Kamide. and Yuki Yano.},
title={Towards Hierarchical Probabilistic CTL Model Checking: Theoretical Foundations},
booktitle={Proceedings of the 11th International Conference on Agents and Artificial Intelligence - Volume 2: ICAART,},
year={2019},
pages={762-769},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0007456507620769},
isbn={978-989-758-350-6},
}

TY - CONF

JO - Proceedings of the 11th International Conference on Agents and Artificial Intelligence - Volume 2: ICAART,
TI - Towards Hierarchical Probabilistic CTL Model Checking: Theoretical Foundations
SN - 978-989-758-350-6
AU - Kamide, N.
AU - Yano, Y.
PY - 2019
SP - 762
EP - 769
DO - 10.5220/0007456507620769

Login or register to post comments.

Comments on this Paper: Be the first to review this paper.