A Logic for Non-deterministic Parallel Abstract State Machines

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 Stärk for reasoning about hierarchical (parallel) ASMs. Our main contribution to this regard is the handling...

Full description

Saved in:
Bibliographic Details
Published inFoundations of Information and Knowledge Systems pp. 334 - 354
Main Authors Ferrarotti, Flavio, Schewe, Klaus-Dieter, Tec, Loredana, Wang, Qing
Format Book Chapter
LanguageEnglish
Published Cham Springer International Publishing 2016
SeriesLecture Notes in Computer Science
Subjects
Abstract State Machine
Function Symbol
Primary Part
Proof System
Successor State
Online AccessGet full text

Cover

More Information
Summary: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 Stärk 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.
Bibliography:Work supported by the Austrian Science Fund (FWF: [P26452-N15]). Project: Behavioural Theory and Logics for Distributed Adaptive Systems.
ISBN:3319300237
9783319300238
ISSN:0302-9743
1611-3349
DOI:10.1007/978-3-319-30024-5_18