A reachability tree for statecharts and analysis of some properties

Information and Software Technology

Volumn 36, Issue 10, 1994, Pages 615-624

  Masiero, PC ^a   Maldonado, JC ^a   Boaventura, IG ^b  

^a UNIVERSITY OF SÃO PAULO   (Brazil)

^b SÃO PAULO STATE UNIVERSITY UNESP   (Brazil)

Author keywords

dynamic properties of statecharts; exhaustive simulation; reachability tree; reactive systems; statecharts

Indexed keywords

ALGORITHMS; COMPUTER AIDED SOFTWARE ENGINEERING; COMPUTER HARDWARE DESCRIPTION LANGUAGES; COMPUTER SIMULATION; COMPUTER SOFTWARE SELECTION AND EVALUATION; FORMAL LANGUAGES; HIERARCHICAL SYSTEMS; LARGE SCALE SYSTEMS; PARALLEL PROCESSING SYSTEMS; PETRI NETS; SEQUENTIAL MACHINES;

DYNAMIC PROPERTIES; FINITE STATE MACHINES; HIERARCHICAL DECOMPOSITION; PARALLELISM; REACHABILITY TREE; STATECHARTS;

TREES (MATHEMATICS);

EID: 0028517399     PISSN: 09505849     EISSN: None     Source Type: Journal    
DOI: 10.1016/0950-5849(94)90021-3     Document Type: Article

References (16)

1. STATECHARTS: a visual formalism for complex systems
2. Biting the silver bullet: toward a brighter future for system development
3. Experiences using statecharts for a system requirement specification
4. A statechart-based specification and verification of realtime scheduling systems
5. Statemaster: a UIMS based on statecharts for prototyping and target implementation
6. Safety Analysis Using Petri Nets
7. Reachability trees for high-level Petri nets
8. STATEMATE: a working environment for the development of complex reactive systems
9. STATECHARTS: on the formal semantics of statecharts
10. A compositional axiomatization of statecharts
11. Dynamical properties of statecharts
12. The Esterel language
13. Editing and simulating behavioural aspects of real time systems
14. Bridging the gap in the presence of infeasible paths: potential uses testing criteria