Modeling Distributed Algorithms by Abstract State Machines Compared to Petri Nets
Ist Teil von
Abstract State Machines, Alloy, B, TLA, VDM, and Z, 2016, p.3-34
Ort / Verlag
Cham: Springer International Publishing
Erscheinungsjahr
2016
Link zum Volltext
Quelle
Alma/SFX Local Collection
Beschreibungen/Notizen
We show how to model distributed algorithms by Abstract State Machines (ASMs). Comparing these models with Petri nets (PNs) reveals a certain number of idiosyncrasies of PNs which complicate both model design and analysis. The ASMs we define illustrate how one can avoid such framework related technicalities.
