Electronic Notes in Theoretical Computer Science · 2001 · 204 citations · 5 references
ComputingComputer ScienceFormal MethodsModel-based Systems EngineeringSystems ModelingDeductive VerificationFinite AutomataFinite-state MachinesModel CheckingSpecification LanguagesVerificationAutomata In Formal VerificationAutomated Model CheckingBüchi AutomataFinite-state VerificationModel VerificationModel-based VerificationState MachinesUnified Modeling Language
The Unified Modeling Language provides two complementary notations, state machines and collaborations, for the specification of dynamic system behavior. We describe a prototype tool, HUGO , that is designed to automatically verify whether the interactions expressed by a collaboration can indeed be realized by a set of state machines. We compile state machines into a PROMELA model and collaborations into sets of Büchi automata (“never claims”). The model checker SPIN is called upon to verify the model against the automata.
5
Gerard J. Holzmann · IEEE Transactions on Software Engineering · 1997 · 3.8K citations
Implementing statecharts in PROMELA/SPIN
Erich Mikk, Yassine Lakhnech, Michael I. Siegel et al. · 2002 · 157 citations