Verification of scope-dependent hierarchical state machines
Torre, Salvatore La, Napoli, Margherita, Parente, Mimmo and Parlato, Gennaro (2008) Verification of scope-dependent hierarchical state machines. Inf. Comput., 206, (9-10), 1161-1177.
- Published Version
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 Shsms and verification is in general harder by an exponential factor. We carefully establish the computational complexity of reachability, cycle detection, and model checking against general Ltl and Ctl specifications. We also discuss some natural and interesting restrictions of the considered problems for which we can prove that Shsms can be verified as much efficiently as Hsms, still preserving an exponential gap of succinctness.
|Divisions:||Faculty of Physical and Applied Science > Electronics and Computer Science > Electronic & Software Systems
|Date Deposited:||13 Jun 2011 14:33|
|Last Modified:||02 Mar 2012 12:00|
|Contributors:||Torre, Salvatore La (Author)
Napoli, Margherita (Author)
Parente, Mimmo (Author)
Parlato, Gennaro (Author)
|Further Information:||Google Scholar|
|RDF:||RDF+N-Triples, RDF+N3, RDF+XML, Browse.|
Actions (login required)