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
来源：
INFORMATION AND COMPUTATION | 2017年 / 252卷
关键词：
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 条
  • [11] Well-Structured Committees
    Gupta, Sushmita
    Jain, Pallavi
    Saurabh, Saket
    PROCEEDINGS OF THE TWENTY-NINTH INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE, 2020, : 189 - 195
  • [12] Well-structured languages
    Geeraerts, Gilles
    Raskin, Jean-Francois
    Van Begin, Laurent
    ACTA INFORMATICA, 2007, 44 (3-4) : 249 - 288
  • [13] Well-structured languages
    Gilles Geeraerts
    Jean-François Raskin
    Laurent Van Begin
    Acta Informatica, 2007, 44 : 249 - 288
  • [14] Ordinal theory for expressiveness of well-structured transition systems
    Bonnet, Remi
    Finkel, Alain
    Haddad, Serge
    Rosa-Velardo, Fernando
    INFORMATION AND COMPUTATION, 2013, 224 : 1 - 22
  • [15] Fundamental structures in well-structured infinite transition systems
    Finkel, A
    Schnoebelen, P
    LATIN '98: THEORETICAL INFORMATICS, 1998, 1380 : 102 - 118
  • [16] Common knowledge in well-structured perfect recall systems
    Garanina N.O.
    Automatic Control and Computer Sciences, 2014, 48 (07) : 381 - 388
  • [17] Model checking μ-Calculus in well-structured transition systems
    Kouzmin, EV
    Shilov, NV
    Sokolov, VA
    11TH INTERNATIONAL SYMPOSIUM ON TEMPORAL REPRESENTATION AND REASONING, PROCEEDINGS, 2004, : 152 - 155
  • [18] A classification of the expressive power of well-structured transition systems
    Abdulla, Parosh Aziz
    Delzanno, Giorgio
    Van Begin, Laurent
    INFORMATION AND COMPUTATION, 2011, 209 (03) : 248 - 279
  • [19] Handling infinitely branching well-structured transition systems
    Blondin, Michael
    Finkel, Alain
    McKenzie, Pierre
    INFORMATION AND COMPUTATION, 2018, 258 : 28 - 49
  • [20] Comparing the expressive power of well-structured transition systems
    Abdulla, Parosh Aziz
    Delzanno, Giorgio
    Van Begin, Laurent
    COMPUTER SCIENCE LOGIC, PROCEEDINGS, 2007, 4646 : 99 - +
12345