liu.seSearch for publications in DiVA
Endre søk
RefereraExporteraLink to record
Permanent link

Direct link
Referera
Referensformat
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Annet format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annet språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf
Flattening of Modelica State Machines: a practical symbolic representation
Linköpings universitet, Institutionen för datavetenskap, Programvara och system. Linköpings universitet, Tekniska fakulteten.
Linköpings universitet, Institutionen för datavetenskap, Programvara och system. Linköpings universitet, Tekniska fakulteten.
Linköpings universitet, Institutionen för datavetenskap, Programvara och system. Linköpings universitet, Tekniska fakulteten.ORCID-id: 0000-0002-3435-4996
2015 (engelsk)Inngår i: Proceedings of the 11th International Modelica Conference: Versailles, France, September 21-23, 2015 / [ed] Peter Fritzson, Hilding Elmqvist, Linköping: Linköping University Electronic Press, 2015, s. 255-263Konferansepaper, Publicerat paper (Fagfellevurdert)
Abstract [en]

Modelica 3.3 introduced dedicated built-in language support for state machines that was inspired by semantics known from Statechart and mode automata formalisms. The specification describes the semantics of these constructs in terms of data-flow equations that allows to relate it to the Modelica DAE representation which is the conceptual intermediate format of Modelica code after instance creation (flattening). However, a complete transformation of state machine constructs into data-flow equations at the stage of flattening requires an early commitment to implementation details that potentially hinders model optimizations at subsequent translation phases. Also, due to the required substantial model transformation the semantic distance between the original source model and the flattened representation is rather large. Hence, this paper proposes a more versatile symbolic representation for flattened state machine constructs that preserves the state machine’s composition structure and allows postponing optimizations to subsequent compiler phases.

sted, utgiver, år, opplag, sider
Linköping: Linköping University Electronic Press, 2015. s. 255-263
Serie
Linköping Electronic Conference Proceedings, ISSN 1650-3686, E-ISSN 1650-3740 ; 118
Emneord [en]
State machine, Mode automata, Flattening, Compilation
HSV kategori
Identifikatorer
URN: urn:nbn:se:liu:diva-131268DOI: 10.3384/ecp15118255Libris ID: 19666889ISBN: 9789176859551 (tryckt)OAI: oai:DiVA.org:liu-131268DiVA, id: diva2:968914
Konferanse
11th International Modelica Conference, Versailles, Frankrike
Tilgjengelig fra: 2016-09-13 Laget: 2016-09-13 Sist oppdatert: 2018-02-19bibliografisk kontrollert

Open Access i DiVA

Fulltekst mangler i DiVA

Andre lenker

Forlagets fulltekst

Søk i DiVA

Av forfatter/redaktør
Thiele, BernhardPop, AdrianFritzson, Peter
Av organisasjonen

Søk utenfor DiVA

GoogleGoogle Scholar

doi
isbn
urn-nbn

Altmetric

doi
isbn
urn-nbn
Totalt: 57 treff
RefereraExporteraLink to record
Permanent link

Direct link
Referera
Referensformat
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Annet format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annet språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf