A Logic for Non-deterministic Parallel Abstract State Machines

被引：3
|
作者：
Ferrarotti, Flavio [1 ]
Schewe, Klaus-Dieter [1 ]
Tec, Loredana [1 ]
Wang, Qing [2 ]
机构：
[1] Software Competence Ctr Hagenberg, A-4232 Hagenberg, Austria
[2] Australian Natl Univ, Res Sch Comp Sci, Canberra, ACT 0200, Australia
来源：
FOUNDATIONS OF INFORMATION AND KNOWLEDGE SYSTEMS (FOIKS 2016) | 2016年 / 9616卷
基金：
奥地利科学基金会;
关键词：
D O I：
10.1007/978-3-319-30024-5_18
中图分类号：
TP18 [人工智能理论];
学科分类号：
081104 ; 0812 ; 0835 ; 1405 ;
摘要：
We develop a logic which enables reasoning about single steps of non-deterministic parallel Abstract State Machines (ASMs). Our logic builds upon the unifying logic introduced by Nanchen and Stark for reasoning about hierarchical (parallel) ASMs. Our main contribution to this regard is the handling of non-determinism (both bounded and unbounded) within the logical formalism. Moreover, we do this without sacrificing the completeness of the logic for statements about single steps of non-deterministic parallel ASMs, such as invariants of rules, consistency conditions for rules, or step-by-step equivalence of rules.
引用
收藏
页码：334 / 354
页数：21
相关论文
共 50 条
  • [1] A unifying logic for non-deterministic, parallel and concurrent abstract state machines
    Ferrarotti, Flavio
    Schewe, Klaus-Dieter
    Tec, Loredana
    Wang, Qing
    ANNALS OF MATHEMATICS AND ARTIFICIAL INTELLIGENCE, 2018, 83 (3-4) : 321 - 349
  • [2] A unifying logic for non-deterministic, parallel and concurrent abstract state machines
    Flavio Ferrarotti
    Klaus-Dieter Schewe
    Loredana Tec
    Qing Wang
    Annals of Mathematics and Artificial Intelligence, 2018, 83 : 321 - 349
  • [3] Optical Designs for Non-deterministic Turing Machines (Extended Abstract)
    Dolev, Shlomi
    Nir, Yuval
    OPTICAL SUPERCOMPUTING, PROCEEDINGS, 2009, 5882 : 47 - 55
  • [4] Distinguing Non-deterministic Timed Finite State Machines
    Gromov, Maxim
    El-Fakih, Khaled
    Shabaldina, Natalia
    Yevtushenko, Nina
    FORMAL TECHNIQUES FOR DISTRIBUTED SYSTEMS, PROCEEDINGS, 2009, 5522 : 137 - +
  • [5] Learning Abstracted Non-deterministic Finite State Machines
    Pferscher, Andrea
    Aichernig, Bernhard K.
    TESTING SOFTWARE AND SYSTEMS, ICTSS 2020, 2020, 12543 : 52 - 69
  • [6] Flexible scheduling for non-deterministic, and-parallel execution of logic programs
    Shen, Kish
    Hermenegildo, Manuel
    Lecture Notes in Computer Science, 1996, 1124
  • [7] A Posteriori Soundness for Non-deterministic Abstract Interpretations
    Might, Matthew
    Manolios, Panagiotis
    VERIFICATION, MODEL CHECKING, AND ABSTRACT INTERPRETATION, 2009, 5403 : 260 - +
  • [8] Bounded sequence testing from non-deterministic finite state machines
    Ipate, Florentin
    TESTING OF COMMUNICATION SYSTEMS, PROCEEDINGS, 2006, 3964 : 55 - 70
  • [9] A logic for Abstract State Machines
    Stärk, RF
    Nanchen, S
    JOURNAL OF UNIVERSAL COMPUTER SCIENCE, 2001, 7 (11): : 980 - 1005
  • [10] Non-deterministic Connectives in Propositional Godel Logic
    Lahav, Ori
    Avron, Arnon
    PROCEEDINGS OF THE 7TH CONFERENCE OF THE EUROPEAN SOCIETY FOR FUZZY LOGIC AND TECHNOLOGY (EUSFLAT-2011) AND LFA-2011, 2011, : 175 - 182
12345