The STATEMATE semantics of statecharts
ACM Transactions on Software Engineering and Methodology (TOSEM)
Model checking
On the antisymmetry of Galois embeddings
Information Processing Letters
Combining Model Checking and Deduction for I/O-Automata
TACAS '95 Proceedings of the First International Workshop on Tools and Algorithms for Construction and Analysis of Systems
The Semantics of Statecharts in HOL
HUG '93 Proceedings of the 6th International Workshop on Higher Order Logic Theorem Proving and its Applications
TYPES '94 Selected papers from the International Workshop on Types for Proofs and Programs
A Comparison of Statecharts Variants
ProCoS Proceedings of the Third International Symposium Organized Jointly with the Working Group Provably Correct Systems on Formal Techniques in Real-Time and Fault-Tolerant Systems
Structure preserving data abstractions for statecharts
FORTE'05 Proceedings of the 25th IFIP WG 6.1 international conference on Formal Techniques for Networked and Distributed Systems
| Hi-index | 0.00 |
Hierarchical Automata represent a structured model of statecharts. They are formalized in Isabelle/HOL. The formalization is on two levels. The first level is the set-based semantics; the second level exploits the tree-like structure of the hierarchical automata to represent them using Isabelle's datatypes and primitive recursive functions. Thereby the proofs about hierarchical automata are simplified. In order to ensure soundness of this twofold approach we define a mapping from the latter to the former representation and prove that it preserves the defining properties of hierarchical automata.