Well-structured graph transformation systems

被引:4
|
作者
Koenig, Barbara [1 ]
Stueckrath, Jan [1 ]
机构
[1] Univ Duisburg Essen, Abt Informat & Angew Kognit Wissensch, Lotharstr 65, D-47057 Duisburg, Germany
关键词
VERIFICATION;
D O I
10.1016/j.ic.2016.03.005
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
Graph transformation systems (GTSs) can be seen as well-structured transition systems (WSTSs) and via well-structuredness it is possible to obtain decidability results for certain classes of GTSs. We present a generic framework, parameterized over the well-quasi-order (wqo), in which several types of GTSs can be seen as (restricted) WSTSs. We instantiate this framework with three orders: the minor ordering, the subgraph ordering and the induced subgraph ordering. Furthermore we consider two case studies where we apply the theory to analyzea leader election protocol and a simple access rights management system with our tool Uncover. (C) 2016 Elsevier Inc. All rights reserved.
引用
收藏
页码:71 / 94
页数:24
相关论文
共 50 条
  • [1] Resilience of Well-structured Graph Transformation Systems
    Oezkan, Okan
    Wuerdemann, Nick
    ELECTRONIC PROCEEDINGS IN THEORETICAL COMPUTER SCIENCE, 2021, (350): : 69 - 88
  • [2] Decidability Results for Well-structured Graph Transformation Systems
    Koenig, Barbara
    Stueckrath, Jan
    ELECTRONIC PROCEEDINGS IN THEORETICAL COMPUTER SCIENCE, 2013, (140): : 87 - 88
  • [3] Decidability of Resilience for Well-Structured Graph Transformation Systems
    Oezkan, Okan
    GRAPH TRANSFORMATION, ICGT 2022, 2022, : 38 - 57
  • [4] Expressiveness of well-structured pushdown systems
    Jin, Yang
    Cai, Xiao-Juan
    Li, Guo-Qiang
    Shanghai Jiaotong Daxue Xuebao/Journal of Shanghai Jiaotong University, 2015, 49 (08): : 1084 - 1089
  • [5] Well-structured transition systems everywhere!
    Finkel, A
    Suhnoebelen, P
    THEORETICAL COMPUTER SCIENCE, 2001, 256 (1-2) : 63 - 92
  • [6] Termination and Boundedness for Well-Structured Pushdown Systems
    Lei, Suhua
    Cai, Xiaojuan
    Ogawa, Mizuhito
    2016 10TH INTERNATIONAL SYMPOSIUM ON THEORETICAL ASPECTS OF SOFTWARE ENGINEERING (TASE), 2016, : 22 - 29
  • [7] Unfolding concurrent well-structured transition systems
    Herbreteau, Frederic
    Sutre, Gregoire
    TOOLS AND ALGORITHMS FOR THE CONSTRUCTION AND ANALYSIS OF SYSTEMS, PROCEEDINGS, 2007, 4424 : 706 - +
  • [8] Ideal Abstractions for Well-Structured Transition Systems
    Zufferey, Damien
    Wies, Thomas
    Henzinger, Thomas A.
    VERIFICATION, MODEL CHECKING, AND ABSTRACT INTERPRETATION, 2012, 7148 : 445 - 460
  • [9] Well-structured model checking of multiagent systems
    Shilov, N. V.
    Garanina, N. O.
    PERSPECTIVES OF SYSTEMS INFORMATICS, 2007, 4378 : 363 - +
  • [10] The well-structured collaborators
    Kerdellant, Christine
    HISTORIA, 2023, (923): : 28 - 30