Concurrent abstract state machines
| E. Börger, K. Schewe. Concurrent abstract state machines. Acta Informatica, volume 53, number 5, pages 469-492, DOI 10.1007/s00236-015-0249-7, 8, 2016. | |
| Autoren | |
| Typ | Artikel |
| Journal | Acta Informatica |
| Verlag | Springer |
| Nummer | 5 |
| Band | 53 |
| DOI | 10.1007/s00236-015-0249-7 |
| Note | online first, October 2015 |
| Monat | 8 |
| Jahr | 2016 |
| Seiten | 469-492 |
| Abstract | A concurrent Abstract State Machine (ASM) is a family of agents each equipped with a sequentialASMto execute.We define the semantics of concurrentASMsby concurrent ASM runs which overcome the problems of Gurevich’s distributed ASM runs and generalize Lamport’s sequentially consistent runs. A postulate characterizing an intuitive understanding of concurrency is formulated. It allows us to state and prove an extension of the sequential ASM thesis to a concurrent ASM thesis. |