From UML State Machines to Petri nets: History Attribute Translation Strategies

被引:0
|
作者
Pais, Rui [1 ,2 ,3 ]
Gomes, Luis [1 ,2 ]
Barros, Joao Paulo [2 ,3 ]
机构
[1] Univ Nova Lisboa, Fac Sci & Technol, P-1200 Lisbon, Portugal
[2] Univ Nova Lisboa, Ctr Technol & Syst, Lisbon, Portugal
[3] Escola Super Tecnol Gestao, Inst Politecn Beja, Lisbon, Portugal
关键词
D O I
暂无
中图分类号
T [工业技术];
学科分类号
08 ;
摘要
This paper presents a set of translation strategies from state machines using the history attribute to a class of non-autonomous Petri nets named Input-Output Place Transition Nets (IOPT nets). IOPT nets extend the well-known low-level Petri net class of place transition nets with input and output signals and events. Other state machine elements translation mechanisms were already proposed and are here revised and improved to support the last available version of UML (UML 2.4 - Beta 2, March 2011). There are various goals that we intend to achieve with the translation from state machines to IOPT nets: benefit from the integration on a Petri net-based framework for the development of embedded systems using co-design techniques allowing generation of code for different platforms and languages; contribution for the development of tools to create, edit, verify proprieties, optimize, support model transformation, execute and visualize UML state machines.
引用
收藏
页码:3776 / 3781
页数:6
相关论文
共 50 条
  • [21] COMBINED USE OF FINITE-STATE MACHINES AND PETRI NETS FOR MODELING COMMUNICATING PROCESSES
    PATTAVINA, A
    TRIGILA, S
    ELECTRONICS LETTERS, 1984, 20 (22) : 915 - 916
  • [22] An Efficient Translation Method from Timed Petri Nets to Timed Automata
    Nakano, Shota
    Yamaguchi, Shingo
    IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 2012, E95A (08) : 1402 - 1411
  • [23] From UML State Machines to Verifiable Lotos Specifications
    Babaee, Reza
    Babamir, Seyed Morteza
    INNOVATIVE COMPUTING TECHNOLOGY, 2011, 241 : 121 - 129
  • [24] Translation from Multisingular Hybrid Petri Nets to Multisingular Hybrid Automata
    Motallebi, Hassan
    Azgomi, Mohammad Abdollahi
    FUNDAMENTA INFORMATICAE, 2014, 130 (03) : 275 - 315
  • [25] Model transformation from coloured Petri nets with prioritized transitions to B machines
    Sun, Pengfei
    Bon, Philippe
    Collart-Dutilleul, Simon
    2015 INTERNATIONAL CONFERENCE ON INDUSTRIAL ENGINEERING AND SYSTEMS MANAGEMENT (IESM), 2015, : 19 - 28
  • [26] Towards Embedded Systems Formal Verification Translation from SysML into Petri Nets
    Szmuc, Wojciech
    Szmuc, Tomasz
    PROCEEDINGS OF THE 25TH INTERNATIONAL CONFERENCE MIXED DESIGN OF INTEGRATED CIRCUITS AND SYSTEM (MIXDES 2018), 2018, : 420 - 423
  • [27] Enhanced Code Generation from UML Composite State Machines
    Badreddin, Omar
    Lethbridge, Timothy C.
    Forward, Andrew
    Elaasar, Maged
    Aljamaan, Hamoud
    Garzon, Miguel A.
    PROCEEDINGS OF THE 2014 2ND INTERNATIONAL CONFERENCE ON MODEL-DRIVEN ENGINEERING AND SOFTWARE DEVELOPMENT (MODELSWARD 2014), 2014, : 235 - 245
  • [28] A concurrency-preserving translation from time Petri nets to networks of timed automata
    Balaguer, Sandie
    Chatain, Thomas
    Haar, Stefan
    FORMAL METHODS IN SYSTEM DESIGN, 2012, 40 (03) : 330 - 355
  • [29] A concurrency-preserving translation from time Petri nets to networks of timed automata
    Sandie Balaguer
    Thomas Chatain
    Stefan Haar
    Formal Methods in System Design, 2012, 40 : 330 - 355
  • [30] From UML 2 Sequence Diagrams to State Machines by Graph Transformation
    Gronmo, Roy
    Moller-Pedersen, Birger
    JOURNAL OF OBJECT TECHNOLOGY, 2011, 10