Verification of Dynamic Register Automata


We consider the verification problem for Dynamic Register Automata (Dra). Dra extend classical register automata by process creation. In this setting, each process is equipped with a finite set of registers in which the process IDs of other processes can be stored. A process can communicate with processes whose IDs are stored in its registers and can send… (More)
DOI: 10.4230/LIPIcs.FSTTCS.2014.653


2 Figures and Tables

Slides referencing similar topics