Statecharts: A visual formalism for complex systems
Science of Computer Programming
The temporal logic of reactive and concurrent systems
The temporal logic of reactive and concurrent systems
IEEE Transactions on Software Engineering - Special issue on formal methods in software practice
The Unified Modeling Language user guide
The Unified Modeling Language user guide
Ready-Simulation Is Not Ready to Express a Modular Refinement Relation
FASE '00 Proceedings of the Third Internationsl Conference on Fundamental Approaches to Software Engineering: Held as Part of the European Joint Conferences on the Theory and Practice of Software, ETAPS 2000
Hierarchical Automata as Model for Statecharts
ASIAN '97 Proceedings of the Third Asian Computing Science Conference on Advances in Computing Science
The Temporal Semantics of Concurrent Programs
Proceedings of the International Sympoisum on Semantics of Concurrent Computation
Modular Verification for a Class of PLTL Properties
IFM '00 Proceedings of the Second International Conference on Integrated Formal Methods
Implementing Statecharts in PROMELA/SPIN
WIFT '98 Proceedings of the Second IEEE Workshop on Industrial Strength Formal Specification Techniques
PLTL-partitioned model checking for reactive systems under fairness assumptions
ACM Transactions on Embedded Computing Systems (TECS)
Hierarchical verification in maude of Lf P software architectures
ECSA'07 Proceedings of the First European conference on Software Architecture
A new two level hierarchy structuring for node partitioning in ad hoc networks
Proceedings of the 2010 ACM Symposium on Applied Computing
| Hi-index | 0.00 |
Hierarchical automata are used to model hierarchical systems. The semantics used is the Kripke structure where states are valued by atomic propositions. This structure can be large in number of states. This paper presents some heuristics to check properties expressed in LTL logic (Linear Temporal Logic). Hierarchical systems are defined in an hierarchical way by a set of subsystems by decomposing every time one or more states in a set of automata. To cope with the combinatorial explosion problem and the check of properties, we consider only the sub-systems concerned by the property to verify and we then deduct its check from it on the global system.