BISIMILARITY AND BEHAVIOUR-PRESERVING RECONFIGURATIONS OF OPEN PETRI NETS

被引:4
|
作者
Baldan, Paolo [1 ]
Corradini, Andrea [2 ]
Ehrig, Hartmut [3 ]
Heckel, Reiko [4 ]
Koenig, Barbara [5 ]
机构
[1] Univ Padua, Dipartimento Matemat Pura & Applicata, I-35100 Padua, Italy
[2] Univ Pisa, Dipartimento Informat, I-56100 Pisa, Italy
[3] Tech Univ Berlin, Inst Softwaretech & Theoret Informat, D-1000 Berlin, Germany
[4] Univ Leicester, Dept Comp Sci, Leicester LE1 7RH, Leics, England
[5] Univ Duisburg Essen, Abt Informat & Angew Kognit Wissensch, Essen, Germany
关键词
Open systems; Petri nets; bisimilarity; compositionality; reconfiguration; behaviour preserving transformations;
D O I
10.2168/LMCS-4(4:3)2008
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
We propose a framework for the specification of behaviour-preserving reconfigurations of systems modelled as Petri nets. The framework is based on open nets, a mild generalisation of ordinary Place/Transition nets suited to model open systems which might interact with the surrounding environment and endowed with a colimit-based composition operation. We show that natural notions of bisimilarity over open nets are congruences with respect to the composition operation. The considered behavioural equivalences differ for the choice of the observations, which can be single firings or parallel steps. Additionally, we consider weak forms of such equivalences, arising in the presence of unobservable actions. We also provide an up-to technique for facilitating bisimilarity proofs. The theory is used to identify suitable classes of reconfiguration rules (in the double-pushout approach to rewriting) whose application preserves the observational semantics of the net.
引用
收藏
页数:41
相关论文
共 50 条
  • [1] Bisimilarity and behaviour-preserving reconfigurations of open Petri nets
    Baldan, Paolo
    Corradini, Andrea
    Ehrig, Hartmut
    Heckel, Reiko
    Koenig, Barbara
    [J]. ALGEBRA AND COALGEBRA IN COMPUTER SCIENCE, PROCEEDINGS, 2007, 4624 : 126 - +
  • [2] Resource Bisimilarity in Petri Nets is Decidable
    Lomazova, Irina A.
    Bashkin, Vladimir A.
    Jancar, Petr
    [J]. FUNDAMENTA INFORMATICAE, 2022, 186 (1-4) : 175 - 194
  • [3] High undecidability of weak bisimilarity for Petri nets
    Jancar, P
    [J]. TAPSOFT '95: THEORY AND PRACTICE OF SOFTWARE DEVELOPMENT, 1995, 915 : 349 - 363
  • [4] UNDECIDABILITY OF BISIMILARITY FOR PETRI NETS AND SOME RELATED PROBLEMS
    JANCAR, P
    [J]. THEORETICAL COMPUTER SCIENCE, 1995, 148 (02) : 281 - 301
  • [5] Behaviour-preserving transition insertions in unfolding prefixes
    Khomenko, Victor
    [J]. PETRI NETS AND OTHER MODELS OF CONCURRENCY - ICATPN 2007, 2007, 4546 : 204 - 222
  • [6] Open Petri nets
    Baez, John C.
    Master, Jade
    [J]. MATHEMATICAL STRUCTURES IN COMPUTER SCIENCE, 2020, 30 (03) : 314 - 341
  • [7] FEASIBLE DYNAMIC RECONFIGURATIONS OF PETRI NETS Application to a Production System
    Khalgui, Mohamed
    Mosbahi, Olfa
    Zhang, Jiafeng
    Li, Zhiwu
    Gharbi, Atef
    [J]. ICSOFT 2011: PROCEEDINGS OF THE 6TH INTERNATIONAL CONFERENCE ON SOFTWARE AND DATABASE TECHNOLOGIES, VOL 2, 2011, : 105 - 110
  • [8] BEHAVIOR PRESERVING REFINEMENTS OF PETRI NETS
    VOGLER, W
    [J]. LECTURE NOTES IN COMPUTER SCIENCE, 1987, 246 : 82 - 93
  • [9] A New Type of Behaviour-Preserving Transition Insertions in Unfolding Prefixes
    Khomenko, Victor
    [J]. GRAPH TRANSFORMATIONS, 2010, 6372 : 75 - 90
  • [10] Structure Preserving Bisimilarity, Supporting an Operational Petri Net Semantics of CCSP
    van Glabbeek, Rob J.
    [J]. CORRECT SYSTEM DESIGN: SYMPOSIUM IN HONOR OF ERNST-RUDIGER OLDEROG ON THE OCCASION OF HIS 60TH BIRTHDAY, 2015, 9360 : 99 - 130