Loading...

Towards a calculus for nondeterministic schemas in Z

Haghighi, H ; Sharif University of Technology | 2012

474 Viewed
  1. Type of Document: Article
  2. DOI: 10.1142/S0218194012500222
  3. Publisher: World Scientific , 2012
  4. Abstract:
  5. In our previous work, we presented a Z-based formalism, called NZ, by which one can explicitly specify bounded, unbounded, erratic, angelic, demonic, loose, strict, singular, and plural nondeterminism. The NZ notation is mainly based on a new notion of operation schemas, called multi-schema. Since the operations of the Z schema calculus do not work on multi-schemas anymore, in this paper we augment NZ with a new set of schema calculus operations that can be applied on multi-schemas as well as ordinary operation schemas. To demonstrate the usability of the resulting formalism, we show how this formalism can assist to model game-like situations and concurrent systems as two well-known classes of nondeterministic systems
  6. Keywords:
  7. Modalities of nondeterminism ; Schema calculus operations ; Concurrent systems ; Formal program development ; Formal Specification ; Non-determinism ; Schema calculus ; Type theory ; Z notation ; Artificial intelligence ; Software engineering ; Calculations
  8. Source: International Journal of Software Engineering and Knowledge Engineering ; Volume 22, Issue 6 , September , 2012 , Pages 839-865 ; 02181940 (ISSN)
  9. URL: http://www.worldscientific.com/doi/abs/10.1142/S0218194012500222