Resilience of Well-structured Graph Transformation Systems
نویسندگان
چکیده
Resilience is a concept of rising interest in computer science and software engineering. For systems which correctness w.r.t. safety condition unachievable, fast recovery demanded. We investigate resilience problems graph transformation systems. Our main contribution the decidability two for well-structured (with strong compatibility). prove our results abstract framework transition apply them to systems, incorporating also adverse conditions.
منابع مشابه
A General Framework for Well-Structured Graph Transformation Systems
Graph transformation systems (GTSs) can be seen as wellstructured transition systems (WSTSs), thus obtaining decidability results for certain classes of GTSs. In earlier work it was shown that wellstructuredness can be obtained using the minor ordering as a well-quasiorder. In this paper we extend this idea to obtain a general framework in which several types of GTSs can be seen as (restricted)...
متن کاملWell-Structured Graph Transformation Systems with Negative Application Conditions
Given a transition system and a partial order on its states, the coverability problem is the question to decide whether a state can be reached that is larger than some given state. For graphs, a typical such partial order is the minor ordering, which allows to specify “bad graphs” as those graphs having a given graph as a minor. Well-structuredness of the transition system enables a finite repr...
متن کاملWell-Structured Pushdown Systems
Pushdown systems (PDSs) model single-thread recursive programs, and well-structured transition systems (WSTSs), such as vector addition systems, are useful to represent non-recursive multi-thread programs. Combining these two ideas, our goal is to investigate wellstructured pushdown systems (WSPDSs), pushdown systems with wellquasi-ordered control states and stack alphabet. This paper focuses o...
متن کاملFault Resilience of Structured P2P Systems
A fundamental problem that confronts structured peer-topeer system that use DHT technologies to map data onto nodes is the performance of the network under the circumstance that a large percentage of nodes join and fail frequently and simultaneously. A careful examination of some typical peer-to-peer networks will contribute a lot to choosing and using certain kind of topology in special applic...
متن کاملChecking Graph-Transformation Systems
In general, it is undecidable whether a terminating graphtransformation system is confluent or not. We introduce the class of coverable hypergraph-transformation systems and show that confluence is decidable for coverable systems that are terminating. Intuitively, a system is coverable if its typing allows to extend each critical pair with a non-deletable context that uniquely identifies the pe...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic proceedings in theoretical computer science
سال: 2021
ISSN: ['2075-2180']
DOI: https://doi.org/10.4204/eptcs.350.5