Affiliation:
1. Universität Oldenburg , Department of Computing Science , Oldenburg , Germany
Abstract
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.
Reference30 articles.
1. Parosh Aziz Abdulla, Kārlis Čerāns, Bengt Jonsson & Yih-Kuen Tsay (1996): General Decidability Theorems for Infinite-State Systems. In: Proceedings of the 11th Annual Symposium on Logic in Computer Science, IEEE Computer Society Press, pp. 313–321, doi:10.1109/LICS.1996.561359.
2. Nathalie Bertrand, Giorgio Delzanno, Barbara König, Arnaud Sangnier & Jan Stückrath (2012): On the Decidability Status of Reachability and Coverability in Graph Transformation Systems. In: 23rd International Conference on Rewriting Techniques and Applications (RTA’12), Leibniz International Proceedings in Informatics, LIPIcs 15, pp. 101–116, doi:10.4230/LIPIcs.RTA.2012.101.
3. Larbi Abdenebaoui, Hans-Jörg Kreowski & Sabine Kuske (2015): Graph-Transformational Swarms with Stationary Members. In: DoCEIS 2015: Technological Innovation for Cloud-Based Engineering Systems, IFIP Advances in Information and Communication Technology 450, pp. 137–144, doi:10.1007/978-3-319-16766-4_15.
4. Christel Baier & Joost-Pieter Katoen (2008): Principles of Model Checking. The MIT Press, doi:10.1093/comjnl/bxp025.
5. Paolo Baldan, Andrea Corradini, Fabio Gadducci & Ugo Montanari (2010): From Petri Nets to Graph Transformation Systems. In: Electronic Communications of the EASST, 26, doi:10.14279/tuj.eceasst.26.368.
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献