A unifying logic for non-deterministic, parallel and concurrent abstract state machines

We develop a logic which enables reasoning about single steps of non-deterministic and parallel Abstract State Machines (ASMs). Our logic builds upon the unifying logic introduced by Nanchen and Stärk for reasoning about hierarchical (parallel) ASMs. Our main contribution is the handling of non-dete...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Annals of mathematics and artificial intelligence Ročník 83; číslo 3-4; s. 321 - 349
Hlavní autoři: Ferrarotti, Flavio, Schewe, Klaus-Dieter, Tec, Loredana, Wang, Qing
Médium: Journal Article
Jazyk:angličtina
Vydáno: Cham Springer International Publishing 01.08.2018
Springer
Springer Nature B.V
Témata:
Algorithms
Artificial Intelligence
Complex Systems
Computer Science
Determinism
Logic
Machinery
Magneto-electric machines
Mathematics
Reasoning
State machines
Transition rules
Parallelism
ASM
Non-determinism
03B70
Logic
Concurrency
ISSN:1012-2443, 1573-7470
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:We develop a logic which enables reasoning about single steps of non-deterministic and parallel Abstract State Machines (ASMs). Our logic builds upon the unifying logic introduced by Nanchen and Stärk for reasoning about hierarchical (parallel) ASMs. Our main contribution is the handling of non-determinism within the logical formalism. We do this without sacrificing the completeness of the logic for statements about single steps of non-deterministic and parallel ASMs, such as invariants of rules, consistency conditions for rules, or step-by-step equivalence of rules. Moreover, we show that the proposed one-step logic can be easily extended to a multiple-step logic which enables reasoning about concurrent ASMs.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1012-2443
1573-7470
DOI:10.1007/s10472-017-9569-3