메뉴 건너뛰기




Volumn 39, Issue 7, 2004, Pages 257-266

Flattening statecharts without explosions

Author keywords

Automatic code generation; Embedded systems; Program synthesis; Semantics; Statecharts

Indexed keywords

ALGORITHMS; CODES (SYMBOLS); COMPUTATIONAL COMPLEXITY; COMPUTER PROGRAMMING LANGUAGES; COMPUTER SIMULATION; MATHEMATICAL MODELS; OPTIMIZATION; SEMANTICS; SET THEORY;

EID: 4544313545     PISSN: 03621340     EISSN: None     Source Type: Journal    
DOI: 10.1145/998300.997200     Document Type: Conference Paper
Times cited : (14)

References (29)
  • 10
    • 0022769976 scopus 로고
    • Graph-based algorithms for boolean function manipulation
    • Aug.
    • R. E. Bryant. Graph-based algorithms for boolean function manipulation. IEEE Transactions on Computers, 35(8):677-691, Aug. 1986.
    • (1986) IEEE Transactions on Computers , vol.35 , Issue.8 , pp. 677-691
    • Bryant, R.E.1
  • 12
    • 84958778942 scopus 로고    scopus 로고
    • Formal verification of UML statecharts with real-time extensions
    • R.-D. Kutsche and H. Weber, editors, Grenoble, France, April. Springer-Verlag
    • A. David, M. O. Möller, and W. Yi. Formal verification of UML statecharts with real-time extensions. In R.-D. Kutsche and H. Weber, editors, Fundamental Approaches to Software Engineering (FASE), volume 2306 of LNCS, pages 218-232, Grenoble, France, April 2002. Springer-Verlag.
    • (2002) Fundamental Approaches to Software Engineering (FASE), Volume 2306 of LNCS , vol.2306 , pp. 218-232
    • David, A.1    Möller, M.O.2    Yi, W.3
  • 14
    • 0028430821 scopus 로고
    • On the power of bounded concurrency I: Finite automata
    • May
    • D. Drusinsky and D. Harel. On the power of bounded concurrency I: Finite automata. Journal of ACM, 41(3):517-539, May 1994.
    • (1994) Journal of ACM , vol.41 , Issue.3 , pp. 517-539
    • Drusinsky, D.1    Harel, D.2
  • 17
    • 0023365727 scopus 로고
    • Statecharts: A visual formalism for complex systems
    • D. Harel. Statecharts: A visual formalism for complex systems. Science of Computer Programming, 8:231-274, 1987.
    • (1987) Science of Computer Programming , vol.8 , pp. 231-274
    • Harel, D.1
  • 24
    • 33746436793 scopus 로고    scopus 로고
    • The compositional properties of UML statechart diagrams
    • C. J. van Rijsbergen, editor, British Computer Society
    • A. J. H. Simons. The compositional properties of UML statechart diagrams. In C. J. van Rijsbergen, editor, 3rd Electronic Workshop on Rigorous Object-Oriented Methods. British Computer Society, 2000.
    • (2000) 3rd Electronic Workshop on Rigorous Object-oriented Methods
    • Simons, A.J.H.1
  • 27
    • 4544316408 scopus 로고    scopus 로고
    • On succinctness of hierarchical state diagrams in absence of message passing
    • M. Mendier, editor, A satellite workshop of ETAPS 2004. Barcelona, Spain, March 2004. To be published in ENTCS. Elsevier Science Publishers
    • A. Wa̧sowski. On Succinctness of Hierarchical State Diagrams in Absence of Message Passing. In M. Mendier, editor, Semantic Foundations of Engineering Design Languages (SFEDL), A satellite workshop of ETAPS 2004. Barcelona, Spain, March 2004. To be published in ENTCS. Elsevier Science Publishers, 2004.
    • (2004) Semantic Foundations of Engineering Design Languages (SFEDL)
    • Wa̧sowski, A.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.