Probabilistic Automata and Probabilistic Logic

被引:0
|
作者
Weidner, Thomas [1 ]
机构
[1] Univ Leipzig, Inst Informat, D-04009 Leipzig, Germany
关键词
POWER;
D O I
暂无
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
We present a monadic second-order logic which is extended by an expected value operator and show that this logic is expressively equivalent to probabilistic automata for both finite and infinite words. We give possible syntax extensions and an embedding of our probabilistic logic into weighted MSO logic. We further derive decidability results which are based on corresponding results for probabilistic automata.
引用
收藏
页码:813 / 824
页数:12
相关论文
共 50 条
  • [21] Probabilistic entailment and a non-probabilistic logic
    Knight, Kevin M.
    [J]. LOGIC JOURNAL OF THE IGPL, 2003, 11 (03) : 353 - 365
  • [22] Probabilistic fuzzy logic and probabilistic fuzzy systems
    Meghdadi, AH
    Akbarzadeh-T, MR
    [J]. 10TH IEEE INTERNATIONAL CONFERENCE ON FUZZY SYSTEMS, VOLS 1-3: MEETING THE GRAND CHALLENGE: MACHINES THAT SERVE PEOPLE, 2001, : 1127 - 1130
  • [23] Probabilistic planning in hybrid probabilistic logic programs
    Saad, Emad
    [J]. SCALABLE UNCERTAINTY MANAGEMENT, PROCEEDINGS, 2007, 4772 : 1 - 15
  • [24] Computing Probabilistic Queries in the Presence of Uncertainty via Probabilistic Automata
    Andronikos, Theodore
    Singh, Alexander
    Giannakis, Konstantinos
    Sioutas, Spyros
    [J]. ALGORITHMIC ASPECTS OF CLOUD COMPUTING, ALGOCLOUD 2017, 2018, 10739 : 106 - 120
  • [25] On verification of Probabilistic timed automata against Probabilistic duration properties
    Van Hung, Dang
    Zhang, Miaomiao
    [J]. 13TH IEEE INTERNATIONAL CONFERENCE ON EMBEDDED AND REAL-TIME COMPUTING SYSTEMS AND APPLICATIONS, PROCEEDINGS, 2007, : 165 - +
  • [26] Chaotic Evolution via Generalized Probabilistic Automata (Probabilistic Arrays)
    Paz, Azaria
    Carlyle, Jack W.
    [J]. COMPUTER JOURNAL, 2012, 55 (05): : 522 - 533
  • [27] Analyzing probabilistic pushdown automata
    Tomáš Brázdil
    Javier Esparza
    Stefan Kiefer
    Antonín Kučera
    [J]. Formal Methods in System Design, 2013, 43 : 124 - 163
  • [28] ioco theory for probabilistic automata
    Gerhold, Marcus
    Stoelinga, Marielle
    [J]. ELECTRONIC PROCEEDINGS IN THEORETICAL COMPUTER SCIENCE, 2015, (180): : 23 - 40
  • [29] Stuttering for Abstract Probabilistic Automata
    Delahaye, Benoit
    Larsen, Kim G.
    Legay, Axel
    [J]. JOURNAL OF LOGIC AND ALGEBRAIC PROGRAMMING, 2014, 83 (01): : 1 - 19
  • [30] REFINEMENT AND DIFFERENCE FOR PROBABILISTIC AUTOMATA
    Delahaye, Benoit
    Fahrenberg, Uli
    Larsen, Kim G.
    Legay, Axel
    [J]. LOGICAL METHODS IN COMPUTER SCIENCE, 2014, 10 (03)