Abstract
Within verification of distributed Abstract State Machines one often has to prove properties related to the state transition level induced by partially ordered runs. This paper shows how such a transition level in form of a transition graph may be constructed. In this way the verification can be carried out directly on the transition graph. The construction itself is given as a sequential non-deterministic ASM. © Springer-Verlag Berlin Heidelberg 2001.
Cite
CITATION STYLE
Eschbach, R. (2001). A verification approach for distributed abstract state machines. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2244 LNCS, pp. 109–115). Springer Verlag. https://doi.org/10.1007/3-540-45575-2_12
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
