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 条

[21] New compact representation of multiple-valued functions, relations, and non-deterministic state machines
Grygiel, S
Perkowski, M
INTERNATIONAL CONFERENCE ON COMPUTER DESIGN: VLSI IN COMPUTERS AND PROCESSORS, PROCEEDINGS, 1998, : 168 - 174
[22] Towards a logic for abstract metafinite state machines
Wang, Qing
Schewe, Klaus-Dieter
FOUNDATIONS OF INFORMATION AND KNOWLEDGE SYSTEMS, PROCEEDINGS, 2008, 4932 : 365 - 380
[23] A complete logic for Database Abstract State Machines
Ferrarotti, Flavio
Schewe, Klaus-Dieter
Tec, Loredana
Wang, Qing
LOGIC JOURNAL OF THE IGPL, 2017, 25 (05) : 700 - 740
[24] Modal Extensions of the Logic of Abstract State Machines
Ferrarotti, Flavio
Schewe, Klaus-Dieter
RIGOROUS STATE-BASED METHODS, ABZ 2024, 2024, 14759 : 123 - 140
[25] Non-deterministic Logic of Informal Provability has no Finite Characterization
Pawlowski, Pawel
JOURNAL OF LOGIC LANGUAGE AND INFORMATION, 2021, 30 (04) : 805 - 817
[26] HEIGHT OF VALUATiONS IN NON-DETERMINISTIC SEMANTICS FOR MODAL LOGIC.
Pawlowski, Pawel
Journal of Applied Logics, 2023, 10 (04): : 587 - 601
[27] Non-deterministic Logic of Informal Provability has no Finite Characterization
Pawel Pawlowski
Journal of Logic, Language and Information, 2021, 30 : 805 - 817
[28] There is no fully abstract fixpoint semantics for non-deterministic languages with infinite computations
Computer Science Department, Uppsala University, Box 311, S-751 05 Uppsala, Sweden
Inf. Process. Lett., 6 (289-293):
[29] There is no fully abstract fixpoint semantics for non-deterministic languages with infinite computations
Nystrom, SO
INFORMATION PROCESSING LETTERS, 1996, 60 (06) : 289 - 293
[30] State agnostic planning graphs: deterministic, non-deterministic, and probabilistic planning
Bryce, Daniel
Cushing, William
Kambhampati, Subbarao
ARTIFICIAL INTELLIGENCE, 2011, 175 (3-4) : 848 - 889

← 1 2 3 4 5 →