Infinite-state graph transformation systems under adverse conditions
| dc.contributor.author | Özkan, Okan | |
| dc.date.accessioned | 2022-01-18T11:29:52Z | |
| dc.date.available | 2022-01-18T11:29:52Z | |
| dc.date.issued | 2021 | |
| dc.description.abstract | We present an approach for modeling adverse conditions by graph transformation systems. To this end, we introduce joint graph transformation systems which involve a system, an interfering environment, and an automaton modeling their interaction. For joint graph transformation systems, we present notions of correctness under adverse conditions. Some instances of correctness are expressible in LTL (linear temporal logic), or in CTL (computation tree logic), respectively. In these cases, verification of joint graph transformation systems is reduced to temporal model checking. To handle infinite state spaces, we incorporate the concept of well-structuredness. We discuss ideas for the verification of joint graph transformation systems using results based on well-structuredness. | en |
| dc.identifier.doi | 10.1515/itit-2021-0011 | |
| dc.identifier.pissn | 2196-7032 | |
| dc.identifier.uri | https://dl.gi.de/handle/20.500.12116/37958 | |
| dc.language.iso | en | |
| dc.publisher | De Gruyter | |
| dc.relation.ispartof | it - Information Technology: Vol. 63, No. 4 | |
| dc.subject | Graph Transformation Systems | |
| dc.subject | Infinite-state Systems | |
| dc.subject | Correctness | |
| dc.subject | Adverse Conditions | |
| dc.subject | Verification | |
| dc.subject | Temporal Logics | |
| dc.title | Infinite-state graph transformation systems under adverse conditions | en |
| dc.type | Text/Journal Article | |
| gi.citation.endPage | 320 | |
| gi.citation.publisherPlace | Berlin | |
| gi.citation.startPage | 311 |