Skip to main content
SpringerLink
Log in

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

  • Published:
Annals of Mathematics and Artificial Intelligence Aims and scope Submit manuscript

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Alur, R.: Principles of Cyber-Physical Systems. MIT Press (2015)

  2. Blass, A., Gurevich, Y.: Abstract state machines capture parallel algorithms. ACM Trans. Comput. Log. 4(4), 578–651 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  3. Blass, A., Gurevich, Y.: Abstract state machines capture parallel algorithms: correction and extension. ACM Trans. Comput. Log. 9(3), 1–32 (2008)

    MathSciNet  MATH  Google Scholar 

  4. Börger, E., Schewe, K.: Concurrent abstract state machines. Acta Inf. 53(5), 469–492 (2016)

    Article  MathSciNet  MATH  Google Scholar 

  5. Börger, E., Stärk, R.F.: Abstract State Machines: a Method for High-Level System Design and Analysis. Springer, New York (2003)

    Book  MATH  Google Scholar 

  6. Fensel, D., Groenboom, R.: MLPM: defining a semantics and axiomatization for specifying the reasoning process of knowledge-based systems. In: Proceedings of the 12th European Conference on Artificial Intelligence (ECAI-96). Budapest, Hungary (1996)

  7. Ferrarotti, F., Schewe, K., Tec, L., Wang, Q.: A Logic for Non-Deterministic Parallel Abstract State Machines. In: Gyssens, M., Simari, G.R. (eds.) Foundations of Information and Knowledge Systems - 9th International Symposium, FoIKS 2016, Linz, Austria, March 7–11, 2016. Proceedings, Lecture Notes in Computer Science, vol. 9616, pp. 334–354. Springer (2016)

  8. Ferrarotti, F., Schewe, K., Tec, L., Wang, Q.: A new thesis concerning synchronised parallel computing - simplified parallel ASM thesis. Theor. Comput. Sci. 649, 25–53 (2016)

    Article  MathSciNet  MATH  Google Scholar 

  9. Floyd, R.W.: Nondeterministic algorithms. J. ACM 14(4), 636–644 (1967). https://doi.org/10.1145/321420.321422

    Article  MATH  Google Scholar 

  10. Groenboom, R., Renardel de Lavalette, G.: Reasoning about dynamic features in specification languages - a modal view on creation and modification. In: Proceedings of the International Workshop on Semantics of Specification Languages (SoSL), pp. 340–355. Springer (1994)

  11. Groenboom, R., Renardel de Lavalette, G.: A formalization of evolving algebras. In: Proceedings of Accolade95. Dutch Research School in Logic (1995)

  12. Gurevich, Y.: Evolving algebras 1993: lipari guide. In: Specification and Validation Methods, pp. 9–36. Oxford University Press (1993)

  13. Gurevich, Y.: Sequential abstract state machines capture sequential algorithms. ACM Trans. Comput. Log. 1(1), 77–111 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  14. Harel, D., Kozen, D., Tiuryn, J.: Dynamic Logic. MIT Press (2000)

  15. Henkin, L.: Completeness in the theory of types. J. Symbolic Logic 15(2), 81–91 (1950). http://projecteuclid.org/euclid.jsl/1183730860

    Article  MathSciNet  MATH  Google Scholar 

  16. Hughes, G., Cresswell, M.: A New Introduction to Modal Logic. Burns & Oates (1996)

  17. Kröger, F., Merz, S.: Temporal Logic and State Systems. Texts in Theoretical Computer Science. An EATCS Series. Springer (2008)

  18. Kruskal, J.B.: On the shortest spanning subtree of a graph and the travelling salesman problem. Proc. Amer. Math. Soc. 2, 48–50 (1956)

    Article  MATH  Google Scholar 

  19. Lamport, L.: How to make a multiprocessor computer that correctly executes multiprocess programs. IEEE Trans. Comput. 28(9), 690–691 (1979)

    Article  MATH  Google Scholar 

  20. Leivant, D.: Higher order logic. In: Gabbay, D.M., Hogger, C.J., Robinson, J.A., Siekmann, J.H. (eds.) Handbook of Logic in Artificial Intelligence and Logic Programming, Deduction Methodologies, vol. 2, pp. 229–322. Oxford University Press (1994)

  21. Merz, S.: On the logic of TLA+. Comput. Artif. Intell. 22(3-4), 351–379 (2003)

    MathSciNet  MATH  Google Scholar 

  22. Nanchen, S.: Verifying Abstract State Machines. Ph.D. Thesis, ETH Zürich (2007)

  23. Renardel de Lavalette, G.: A logic of modification and creation. In: Logical Perspectives on Language and Information. CSLI Publications (2001)

  24. Schellhorn, G., Tofan, B., Ernst, G., Pfähler, J., Reif, W.: RGITL: a temporal logic framework for compositional reasoning about interleaved programs. Ann. Math. Artif. Intell. 71(1-3), 131–174 (2014)

    Article  MathSciNet  MATH  Google Scholar 

  25. Schmalz, M.: Formalizing the Logic of Event-B. Ph.D. Thesis, ETH Zürich (2012)

  26. Schönegge, A.: Extending Dynamic Logic for Reasoning About Evolving Algebras. Technical Report 49/95, Universität Karlsruhe, Fakultät Für Informatik (1995)

  27. Stärk, R., Nanchen, S.: A logic for abstract state machines. J. Univ. Comput. Sci. 7(11), 980–1005 (2001)

  28. Vapnik, V.N.: The Nature of Statistical Learning Theory. Springer New York, Inc., New York (1995)

    Book  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Software Competence Center Hagenberg, 4232, Hagenberg, Austria

    Flavio Ferrarotti, Klaus-Dieter Schewe & Loredana Tec

  2. Research School of Computer Science, The Australian National University, Canberra, Australia

    Qing Wang

Authors
  1. Flavio Ferrarotti
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Klaus-Dieter Schewe
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Loredana Tec
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Qing Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Flavio Ferrarotti.

Additional information

The research reported in this paper results from the projects Behavioral Theory and Logics for Distributed Adaptive Systems and Higher-Order Logics and Structures supported by the Austrian Science Fund (FWF: [P26452-N15] & [I2420-N31]). It was further supported by the Austrian Research Promotion Agency (FFG) through the COMET funding for the Software Competence Center Hagenberg.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Ferrarotti, F., Schewe, KD., Tec, L. et al. A unifying logic for non-deterministic, parallel and concurrent abstract state machines. Ann Math Artif Intell 83, 321–349 (2018). https://doi.org/10.1007/s10472-017-9569-3

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10472-017-9569-3

Keywords

Mathematics Subject Classification (2010)

Search

Navigation