{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,21]],"date-time":"2025-04-21T04:08:11Z","timestamp":1745208491828,"version":"3.40.4"},"reference-count":9,"publisher":"World Scientific Pub Co Pte Ltd","issue":"06","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Soft. Eng. Knowl. Eng."],"published-print":{"date-parts":[[2012,9]]},"abstract":"<jats:p>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.<\/jats:p>","DOI":"10.1142\/s0218194012500222","type":"journal-article","created":{"date-parts":[[2012,11,6]],"date-time":"2012-11-06T08:48:30Z","timestamp":1352191710000},"page":"839-865","source":"Crossref","is-referenced-by-count":0,"title":["TOWARDS A CALCULUS FOR NONDETERMINISTIC SCHEMAS IN Z"],"prefix":"10.1142","volume":"22","author":[{"given":"HASSAN","family":"HAGHIGHI","sequence":"first","affiliation":[{"name":"Faculty of Electrical and Computer Engineering, Shahid Beheshti University GC, Tehran, Iran"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"SEYYED-HASSAN","family":"MIRIAN-HOSSEINABADI","sequence":"additional","affiliation":[{"name":"Department of Computer Engineering, Sharif University of Technology, Tehran, Iran"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2012,11,6]]},"reference":[{"key":"rf3","doi-asserted-by":"publisher","DOI":"10.1023\/A:1012952311559"},{"journal-title":"Formal Aspects of Computing","first-page":"1","author":"Derrick J.","key":"rf4"},{"key":"rf7","doi-asserted-by":"crossref","first-page":"109","DOI":"10.3233\/FUN-2008-881-205","volume":"88","author":"Haghighi H.","journal-title":"Fundamenta Informaticae"},{"volume":"1","journal-title":"Formal Aspects of Computing","author":"Henson M. C.","key":"rf9"},{"volume-title":"Modalities of Nondeterminacy","year":"1991","author":"Hesselink W. H.","key":"rf10"},{"journal-title":"Proc. Logic Colloquium 73","first-page":"73","author":"Martin-L\u00f6f P.","key":"rf13"},{"key":"rf14","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(98)00233-3"},{"key":"rf17","doi-asserted-by":"publisher","DOI":"10.1145\/248621.248623"},{"volume-title":"Using Z, Specifications, Refinement and Proof","year":"1996","author":"Woodcock J.","key":"rf19"}],"container-title":["International Journal of Software Engineering and Knowledge Engineering"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0218194012500222","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,20]],"date-time":"2025-04-20T09:08:43Z","timestamp":1745140123000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0218194012500222"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,9]]},"references-count":9,"journal-issue":{"issue":"06","published-online":{"date-parts":[[2012,11,6]]},"published-print":{"date-parts":[[2012,9]]}},"alternative-id":["10.1142\/S0218194012500222"],"URL":"https:\/\/doi.org\/10.1142\/s0218194012500222","relation":{},"ISSN":["0218-1940","1793-6403"],"issn-type":[{"type":"print","value":"0218-1940"},{"type":"electronic","value":"1793-6403"}],"subject":[],"published":{"date-parts":[[2012,9]]}}}