Andrzej Wasowski  Home/Search
Context
Related
| pw.edu.pl/~wasowsk...085wasowski.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: pw.edu.pl/~wasowski/pub (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We present a polynomial upper bound for flattening of UML statecharts. An e#cient flattening technique is derived and implemented in SCOPE---a code generator targeting constrained embedded systems. Programs generated with this new technique are both faster and smaller than those produced by non-flattening code generators. Our approach scales well for big models and exhibits good properties with respect to memory usage, automatic analysis of worst-case reaction time and automatic validation of... (Update)
Active bibliography (related documents): More All
1.0: Succinctness of Hierarchical State Diagrams in Absence of.. - Wasowski (2004) (Correct)
0.8: On Efficient Program Synthesis from Statecharts - Wasowski (2003) (Correct)
0.8: On Succinctness of Hierarchical State Diagrams in Absence of.. - Wasowski (2004) (Correct)
Similar documents based on text: More All
0.2: On the Formal Semantics of VisualSTATE Statecharts - Wasowski, Sestoft (2002) (Correct)
0.2: Crossing the Gap between Semantics and Practice: Crafting a.. - Wasowski (2002) (Correct)
0.2: Compile-time Scope Resolution for Statecharts Transitions - Wasowski, Sestoft (2002) (Correct)
BibTeX entry: (Update)
@misc{ wasowski-flattening,
author = "Andrzej Wasowski",
title = "Flattening Statecharts without Explosions",
url = "citeseer.ist.psu.edu/wasowski04flattening.html" }
Citations (may not include all citations):1726 Graph-based algorithms for boolean function manipulation - Bryant - 1986
828 Model Checking - Clarke - 1999
30 the power of bounded concurrency I: Finite automata - Drusinsky, Harel - 1994
25 Testing Object-Oriented Systems (context) - Binder - 2000
22 Communicating hierarchical state machines - Alur, Kannan et al. - 1999
9 Formal verification of UML statecharts with real-time extens.. - David, Moller et al. - 2002
7 Statechart testing method for aircraft control systems (context) - Bogdanov, Holcombe - 2001
7 Worst-Case Execution Times and Schedulability Analysis of St.. (context) - Erpenbach
5 cient code synthesis from statecharts (context) - Bjorklund, Lilius et al. - 2001
5 Eclipse feature logic analysis - Bond, Ivancic et al. - 2001
5 Automated testing of Harel's statecharts (context) - Bogdanov - 2000
4 Verification hierarchical stateevent system using reusabilit.. (context) - Andersen, Lind et al. - 1999
3 Properties of concurrently taken transitions of Harel statec.. (context) - Bogdanov, Holcombe - 2002
2 Converting statecharts into Java code (context) - Ali, Tanaka - 1999
1 Model checking UML statecharts with time (context) - Diethers, Goltz et al.
Documents on the same site (http://www.mini.pw.edu.pl/~wasowski/pub.html): More
On the Formal Semantics of VisualSTATE Statecharts - Wasowski, Sestoft (2002) (Correct)
Compile-time Scope Resolution for Statecharts Transitions - Wasowski, Sestoft (2002) (Correct)
Crossing the Gap between Semantics and Practice: Crafting a.. - Wasowski (2002) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC