Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Determinate Composition of FMUs for Co-Simulation
University of California, Berkeley and Linköping University.ORCID iD: 0000-0001-8457-4105
University of California, Berkeley.
IBM.
University of California, Berkeley.
Show others and affiliations
2013 (English)In: Proceedings of the International Conference on Embedded Software (EMSOFT 2013), IEEE conference proceedings, 2013, 1-12 p.Conference paper, Published paper (Refereed)
Abstract [en]

In this paper, we explain how to achieve deterministic execution of FMUs (Functional Mockup Units) under the FMI (Functional Mockup Interface) standard. In particular, we focus on co-simulation, where an FMU either contains its own internal simulation algorithm or serves as a gateway to a simulation tool. We give conditions on the design of FMUs and master algorithms (which orchestrate the execution of FMUs) to achieve deterministic co-simulation. We show that with the current version of the standard, these conditions demand capabilities from FMUs that are optional in the standard and rarely provided by an FMU in practice. When FMUs lacking these required capabilities are used to compose a model, many basic modeling capabilities become unachievable, including simple discrete-event simulation and variable-step-size numerical integration algorithms. We propose a small extension to the standard and a policy for designing FMUs that enables deterministic execution for a much broader class of models. The extension enables a master algorithm to query an FMU for the time of events that are expected in the future. We show that a model can be executed deterministically if all FMUs in the model are either memoryless or implement one of rollback or step-size prediction. We show further that such a model can contain at most one “legacy” FMU that is not memoryless and provides neither rollback nor step-size prediction.

Place, publisher, year, edition, pages
IEEE conference proceedings, 2013. 1-12 p.
National Category
Computer Science
Identifiers
URN: urn:nbn:se:kth:diva-164162DOI: 10.1109/EMSOFT.2013.6658580OAI: oai:DiVA.org:kth-164162DiVA: diva2:803899
Conference
International Conference on Embedded Software (EMSOFT 2013), Montreal, Canada, 2013
Note

QC 20150519

Available from: 2015-04-14 Created: 2015-04-14 Last updated: 2016-07-15Bibliographically approved

Open Access in DiVA

fulltext(666 kB)21 downloads
File information
File name FULLTEXT02.pdfFile size 666 kBChecksum SHA-512
9025df373e690c867abfd552ddbd3af817c7a6004d4f22b8d54d410a8544c48d5a1ecf9b1b23756f2562022171a879a6fd4ebc45096663ce0a570ef40be798da
Type fulltextMimetype application/pdf

Other links

Publisher's full textIEEEXplore

Authority records BETA

Broman, David

Search in DiVA

By author/editor
Broman, David
Computer Science

Search outside of DiVA

GoogleGoogle Scholar
Total: 50 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

doi
urn-nbn

Altmetric score

doi
urn-nbn
Total: 131 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf