In this paper we consider the problem of model checking for well structured Communicating Hierarchical Machines (CHMs), i.e. Finite State Machines with additional features of hierarchy and concurrency. For model checking we follow the automaton theoretic approach, defining an algorithm which solves the problem of model checking without flattening the structure of CHMs.
Structural Model Checking for Communicating Hierarchical Machines / R., Lanotte; A., Maggiolo Schettini; Peron, Adriano. - STAMPA. - 3153:(2004), pp. 525-536. [10.1007/978-3-540-28629-5_40]
Structural Model Checking for Communicating Hierarchical Machines
PERON, ADRIANO
2004
Abstract
In this paper we consider the problem of model checking for well structured Communicating Hierarchical Machines (CHMs), i.e. Finite State Machines with additional features of hierarchy and concurrency. For model checking we follow the automaton theoretic approach, defining an algorithm which solves the problem of model checking without flattening the structure of CHMs.File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
