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-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.

[1]  G. R. D. Lavalette.  A Logic of Modification and Creation , 2001 .

[2]  Gidon Ernst,et al.  RGITL: A temporal logic framework for compositional reasoning about interleaved programs , 2014, Annals of Mathematics and Artificial Intelligence.

[3]  Robert W. Floyd,et al.  Nondeterministic Algorithms , 1967, JACM.

[4]  Stanislas Nanchen.  Verifying abstract state machines , 2007 .

[5]  Klaus-Dieter Schewe,et al.  A Logic for Non-deterministic Parallel Abstract State Machines , 2016, FoIKS.

[6]  Jerzy Tiuryn,et al.  Dynamic logic , 2001, SIGA.

[7]  Andreas Blass,et al.  Abstract state machines capture parallel algorithms: Correction and extension , 2006, TOCL.

[8]  Dieter Fensel,et al.  MLPM: Defining a Semantics and Axiomatization for Specifying the Reasoning Process of Knowleged-based Systems , 1996, ECAI.

[9]  Robert F. Stärk,et al.  A Logic for Abstract State Machines , 2001, J. Univers. Comput. Sci..

[10]  Klaus-Dieter Schewe,et al.  Concurrent abstract state machines , 2016, Acta Informatica.

[11]  Max J. Cresswell,et al.  A New Introduction to Modal Logic , 1998 .

[12]  Klaus-Dieter Schewe,et al.  A new thesis concerning synchronised parallel computing - simplified parallel ASM thesis , 2015, Theor. Comput. Sci..

[13]  Gerard Renardel de Lavalette,et al.  A Formalisation of Evolving Algebras , 1995 .

[14]  Arno Schonegge,et al.  Extending Dynamic Logic for Reasoning about Evolving Algebras , 1995 .

[15]  Yuri Gurevich,et al.  Evolving algebras 1993: Lipari guide , 1995, Specification and validation methods.

[16]  Orna Grumberg,et al.  A game-based framework for CTL counterexamples and 3-valued abstraction-refinement , 2007, TOCL.

[17]  Diane Boyer,et al.  ABSTRACT STATE MACHINES..A METHOD FOR HIGH-LEVEL SYSTEM DESIGN AND ANALYSIS , 2019 .

[18]  Matthias Schmalz,et al.  Formalizing the logic of event-B: Partial functions, definitional extensions, and automated theorem proving , 2012 .

[19]  Vladimir N. Vapnik,et al.  The Nature of Statistical Learning Theory , 2000, Statistics for Engineering and Information Science.

[20]  Daniel Leivant,et al.  Higher order logic , 1994, Handbook of Logic in Artificial Intelligence and Logic Programming.

[21]  Leslie Lamport,et al.  How to Make a Multiprocessor Computer That Correctly Executes Multiprocess Programs , 2016, IEEE Transactions on Computers.

[22]  J. Kruskal.  On the shortest spanning subtree of a graph and the traveling salesman problem , 1956 .

[23]  Stephan Merz,et al.  Temporal Logic and State Systems (Texts in Theoretical Computer Science. An EATCS Series) , 2010 .

[24]  Stephan Merz,et al.  On the Logic of TLA+ , 2003, Comput. Artif. Intell..

[25]  Rajeev Alur,et al.  Principles of Cyber-Physical Systems , 2015 .

[26]  Gregory H. Harris,et al.  Review of "Abstract state machines: a method for high-level system design and analysis" by Egon Börger and Robert Stärk. Springer-Verlag 2003. , 2004, SOEN.

[27]  Gerard R. Renardel de Lavalette,et al.  Reasoning About Dynamic Features in Specification Languages - A Modal View on Creation and Modification , 1993, Semantics of Specification Languages.

[28]  Stephan Merz,et al.  Temporal Logic and State Systems , 2008, Texts in Theoretical Computer Science. An EATCS Series.

[29]  Yuri Gurevich,et al.  Sequential abstract-state machines capture sequential algorithms , 2000, TOCL.

[30]  Andreas Blass,et al.  Abstract state machines capture parallel algorithms , 2003, TOCL.

[31]  Leon Henkin,et al.  Completeness in the theory of types , 1950, Journal of Symbolic Logic.