Examples

Dining Philosophers The problem and a solution has been introduced by Edsger W. Dijkstra. This CoreASM implementation has been created by George Ma and illustrates some interesting features of AMS as multi agents and non-deterministic choice.

Edsger W. Dijkstra: Hierarchical ordering of sequential processes. In: Acta Informatica. 1(2), 1971, p. 115–138

Distributed Termination Detection This specification is one result of a case study worked on during the Dagstuhl Seminar 13372 "Integration of Tools for Rigorous Software Construction and Analysis".

Dijkstra, Edsger W.; Feijen, W.H.J.; Gasteren, A.J.M.; Derivation of a termination detection algorithm for distributed computations. In: Control Flow and Data Flow: Concepts of Distributed Programming. Broy, Manfred (ed.), 1986, Springer, p. 507-512

Leader Election A nice CoreASM example of using ASM for highlevel specification, refinement, and correctness proof of the refinement, done by Julian Lettner based on Korach et al.

Ephraim Korach, Shay Kutten, Shlomo Moran. A Modular Technique for the Design of Efficient Distributed Leader Finding Algorithms. ACM Transactions on Programming Languages and Systems 12 (1), 1990, p. 84–101.