Extended symbolic transition graphs with assignment

Abstract

An extension of symbolic transition graphs with assignment is proposed which combines the advantages of both the assignment-before-action and the assignment-after-action approaches: like the former it allows a simple set of rules to be designed for generating finite symbolic graphs from regular value-passing process descriptions; like the later it avoids… (More)
DOI: 10.1109/COMPSAC.2005.76

4 Figures and Tables

Topics

  • Presentations referencing similar topics