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
Verifying dynamic semantic composability of BOM-based composed models using colored petri nets
KTH, School of Information and Communication Technology (ICT), Software and Computer systems, SCS.
KTH, School of Information and Communication Technology (ICT), Software and Computer systems, SCS.
KTH, School of Information and Communication Technology (ICT), Software and Computer systems, SCS.
2012 (English)In: Principles of Advanced and Distributed Simulation (PADS), 2012 ACM/IEEE/SCS 26th Workshop on, IEEE , 2012, 250-257 p.Conference paper, Published paper (Refereed)
Abstract [en]

Model reuse is a promising and appealing convention for effective development of simulation systems as it offers reduction in development cost and time. Various methodological advances in this area have given rise to the development of different component reusability frameworks such as BOM (Base Object Model). But lack of component matching and weak support for compos ability verification and validation, in these frameworks, makes it difficult to achieve effective and meaningful reuse. In this paper we focus on Compos ability verification and propose a process to verify BOM based composed model at dynamic semantic level. We suggest an extension to the BOM components, to capture behavior at a greater detail. Then we transform the extended BOM into our proposed Colored Petri Nets (CPN) based component model so that the components can be composed and executed at an abstract level. Subsequently we advocate to use CPN tools and analysis techniques to verify that the model satisfy given requirements. We classify the properties of a system among different groups and express the model's requirements by selecting some of the properties from these groups to form requirement specification. Also we present an example of a Field Artillery model, in which we select a set of properties as requirement specification, and explain how CPN state-space analysis technique is used to verify the required properties. Our experience confirms that CPN tools provide strong support for verification of composed models.

Place, publisher, year, edition, pages
IEEE , 2012. 250-257 p.
Series
Workshop on Principles of Advanced and Distributed Simulation, ISSN 1087-4097
Keyword [en]
Colored Petri Nets, Deadlock, Dynamic Semantic Composability, Field Artillery scenario, Model Transformation, Model Verification, State-space Analysis
National Category
Computer Systems
Identifiers
URN: urn:nbn:se:kth:diva-108019DOI: 10.1109/PADS.2012.48ISI: 000312652600040Scopus ID: 2-s2.0-84869461615ISBN: 978-076954714-5 (print)OAI: oai:DiVA.org:kth-108019DiVA: diva2:580181
Conference
2012 ACM/IEEE/SCS 26th Workshop on Principles of Advanced and Distributed Simulation, PADS 2012, 15 July 2012 through 19 July 2012, Zhangjiajie
Funder
ICT - The Next Generation
Note

QC 20121221

Available from: 2012-12-21 Created: 2012-12-19 Last updated: 2014-01-24Bibliographically 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
Computer Systems

Search outside of DiVA

GoogleGoogle Scholar

doi
isbn
urn-nbn

Altmetric score

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