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
Statemachine Matching in BOM based model Composition
KTH, School of Information and Communication Technology (ICT), Communication: Services and Infrastucture, Software and Computer Systems, SCS.
KTH, School of Information and Communication Technology (ICT), Communication: Services and Infrastucture, Software and Computer Systems, SCS.
KTH, School of Information and Communication Technology (ICT), Communication: Services and Infrastucture, Software and Computer Systems, SCS.
2009 (English)In: IEEE ACM DIS SIM REAL TIME / [ed] Turner SJ, Roberts D, Cai W, ElSaddik A, Los Alamitos, CA: IEEE COMPUTER SOC , 2009, 136-143 p.Conference paper, Published paper (Refereed)
Abstract [en]

Base Object Model (BOM) is a component-based standard designed to support reusability and Composability. Reusability helps in reducing time and cost of the development of a simulation process. Composing predefined components such as BOMs is a well known approach to achieve reusability. However, there is a need for a matching mechanism to identify whether a set of components are composable or not. Although BOM provides good model representation, it lacks capability to express semantic and behavioral matching. In this paper we propose an approach for matching behavior of BOM components by matching their statemachines. Our proposed process includcs a static and a dynamic matching phase. In the static matching phase, we apply a set of rules to validate the structure of statemachines. In the dynamic matching phase, we execute the statemachines together at an abstract level on our proposed execution framework. We have developed this, framework using the Slate Chart Extensible Markup Language (SCXML), which is a W3C compliant standard. If the execution terminates successfully (i.e. reaches specified final stales) we conclude that there is a positive match and the behavior of these BOMs is composable. We describe the matching process and the implementation of our runtime environment in detail and present a case study as proof of concept.

Place, publisher, year, edition, pages
Los Alamitos, CA: IEEE COMPUTER SOC , 2009. 136-143 p.
Series
IEEE/ACM International Symposium on Distributed Simulation and Real-Time Applications, ISSN 1550-6525
Keyword [en]
Statemachine matching, BOM Composition, SCXML, Abstract Level Execution
Identifiers
URN: urn:nbn:se:kth:diva-30154DOI: 10.1109/DS-RT.2009.19ISI: 000275316100017Scopus ID: 2-s2.0-77951449991ISBN: 978-0-7695-3868-6 (print)OAI: oai:DiVA.org:kth-30154DiVA: diva2:401809
Conference
13th IEEE/ACM Symposium on Distributed Simulation and Real-Time Applications (DS-RT 2009) Singapore, SINGAPORE, OCT 25-28, 2009
Note
QC 20110303Available from: 2011-03-04 Created: 2011-02-21 Last updated: 2011-03-04Bibliographically approved

Open Access in DiVA

No full text

Other links

Publisher's full textScopus

Search in DiVA

By author/editor
Mahmood, ImranAyani, RassulVlassov, Vladimir
By organisation
Software and Computer Systems, SCS

Search outside of DiVA

GoogleGoogle Scholar

doi
isbn
urn-nbn

Altmetric score

doi
isbn
urn-nbn
Total: 26 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