La Torre, Salvatore, Napoli, Margherita, Parente, Mimmo and Parlato, Gennaro
Verification of Succinct Hierarchical State Machines
At Conference on Language and Automata Theory and Applications (LATA).
A hierarchical state machine (HSM) is a finite state machine where a vertex can either expand to another hierarchical state machine (box) or be a basic vertex (node). Each node is labeled with atomic propositions. We study an extension of such model which allows atomic propositions to label also boxes (SHSM). We show that SHSMs can be exponentially more succinct than HSMs, and verification is in general harder by an exponential factor. Also, we show for a subclass of SHSMs (which can still be exponentially more succinct than HSMs) the same upper bounds as for HSMs.
Conference or Workshop Item
|Venue - Dates:
||Conference on Language and Automata Theory and Applications (LATA), 2007-01-01
||Electronic & Software Systems
||03 Nov 2014 09:48
||22 Feb 2017 11:21
|Further Information:||Google Scholar|
Actions (login required)