IRUS Total

Abstraction and probabilities for hybrid logics

File Description SizeFormat 
Abstraction and probabilities for hybrid logics.pdf175.47 kBAdobe PDFView/Open
Title: Abstraction and probabilities for hybrid logics
Authors: Huth,M.
Item Type: Journal Article
Abstract: We suggest and develop mathematical foundations for quantitative versions of hybrid logics by means of two related themes: a relational abstraction technique for hybrid computation tree logic and hybrid Kripke structures as an extension of the model-checking framework for computation tree logic with the ability to name, bind, and retrieve states; and a syntax and semantics for hybrid probabilistic computation tree logic over hybrid extensions of labelled Markov chains for which the relational abstraction techniques of hybrid Kripke structures should be transferable.
Issue Date: 2-Jan-2005
Citation: Electronic Notes in Theoretical Computer Science Vol.( 112 ) No.( 2 ) pp 61 - 76
URI: http://hdl.handle.net/10044/1/804
Publisher Link: http://dx.doi.org/10.1016/j.entcs.2004.01.023
ISSN: 1571-0661
Start Page: 61
End Page: 76
Copyright Statement: © 2004 Elsevier B.V. This is the author’s version of a work that was accepted for publication in Electronic Notes in Theoretical Computer Science. Changes resulting from the publishing process, such as peer review, editing, corrections, structural formatting, and other quality control mechanisms may not be reflected in this document. Changes may have been made to this work since it was submitted for publication. A definitive version was subsequently published in Electronic Notes in Theoretical Computer Science, volume 112, issue 2 (January 2005). doi:10.1016/j.entcs.2004.01.023.
Volume: 112
Appears in Collections:Quantitative Analysis and Decision Science