IDEAS home Printed from https://ideas.repec.org/a/taf/nmcmxx/v21y2015i2p153-179.html
   My bibliography  Save this article

Partitioned event graph: formalizing LP-based modelling of parallel discrete-event simulation

Author

Listed:
  • Bing Wang
  • Bo Deng
  • Fei Xing
  • Dongxia Wang
  • Yiping Yao

Abstract

Logical process (LP) is a modelling paradigm widely used in parallel discrete-event simulation (PDES). However, effective methods for formalizing LP-based modelling of PDES are lacking. This prevents an unambiguous, platform-independent description of LP-based models. We present a formalism named partitioned event graph (PEG) as a solution. PEG extends classical event graph formalism towards a formal specification for LP-based PDES models. We map between PEG and LP-based models, define the structural operational semantics (SOS) in a timed-labelled transition system, and discuss the Wallclock time-based execution. We propose a PEG-based model transformation framework for PDES, which has three model representation phases and distinguishes amongst four kinds of personnel roles. Finally, we present a domain-specific language (DSL) for the PDES of a Lotka–Volterra system and obtain preliminary parallel simulation results using YinHe Simulation Utilities for Parallel Environment (YHSUPE). The case study shows that the PEG-based framework not only effectively transforms a DSL into the LP paradigm, but will also result in efficient parallel simulation on a specific platform. In summary, by setting out specific characteristics for event scheduling and state space partition in the LP paradigm, PEG provides a formal method for model behaviour analysis and cross-platform model transformation.

Suggested Citation

  • Bing Wang & Bo Deng & Fei Xing & Dongxia Wang & Yiping Yao, 2015. "Partitioned event graph: formalizing LP-based modelling of parallel discrete-event simulation," Mathematical and Computer Modelling of Dynamical Systems, Taylor & Francis Journals, vol. 21(2), pages 153-179, March.
  • Handle: RePEc:taf:nmcmxx:v:21:y:2015:i:2:p:153-179
    DOI: 10.1080/13873954.2014.911750
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/13873954.2014.911750
    Download Restriction: Access to full text is restricted to subscribers.

    File URL: https://libkey.io/10.1080/13873954.2014.911750?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:taf:nmcmxx:v:21:y:2015:i:2:p:153-179. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/NMCM20 .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.