{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T02:40:59Z","timestamp":1725763259294},"reference-count":0,"publisher":"EasyChair","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"abstract":"<jats:p>The various possible semantics of Dijkstra\u2019s guarded commands are elucidated by means of a new graph-based low-level, generic specification language designed for asynchronous nondeterministic algorithms. The graphs incorporate vertices for actions and edges indicating control flow alongside edges for data flow. This formalism allows one to specify, not just input-output behavior nor only what actions take place, but also precisely how often and in what order they transpire.<\/jats:p>","DOI":"10.29007\/2kx9","type":"proceedings-article","created":{"date-parts":[[2024,5,27]],"date-time":"2024-05-27T22:10:12Z","timestamp":1716847812000},"page":"30-6","source":"Crossref","is-referenced-by-count":0,"title":["Alternate Semantics of the Guarded Conditional"],"prefix":"10.29007","volume":"18","author":[{"given":"Nachum","family":"Dershowitz","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"11545","event":{"name":"LPAR 2024 Complementary Volume"},"container-title":["Kalpa Publications in Computing"],"original-title":[],"deposited":{"date-parts":[[2024,5,27]],"date-time":"2024-05-27T22:10:13Z","timestamp":1716847813000},"score":1,"resource":{"primary":{"URL":"https:\/\/easychair.org\/publications\/paper\/1HKl"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"references-count":0,"URL":"https:\/\/doi.org\/10.29007\/2kx9","relation":{},"ISSN":["2515-1762"],"issn-type":[{"type":"print","value":"2515-1762"}],"subject":[]}}