A Logic for Non-Deterministic Parallel Abstract State Machines
Logic in Computer Science
2017-06-01 v1
Abstract
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\"ark 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.
Keywords
Cite
@article{arxiv.1705.11097,
title = {A Logic for Non-Deterministic Parallel Abstract State Machines},
author = {Flavio Ferrarotti and Klaus-Dieter Schewe and Loredana Tec and Qing Wang},
journal= {arXiv preprint arXiv:1705.11097},
year = {2017}
}
Comments
arXiv admin note: substantial text overlap with arXiv:1602.07486