Invariant Analysis For Multi Agent Graph Transformation Systems Using K Induction
DOWNLOAD
Download Invariant Analysis For Multi Agent Graph Transformation Systems Using K Induction PDF/ePub or read online books in Mobi eBooks. Click Download or Read Online button to get Invariant Analysis For Multi Agent Graph Transformation Systems Using K Induction book now. This website allows unlimited access to, at the time of writing, more than 1.5 million titles, including hundreds of thousands of titles in various foreign languages. If the content not found or just blank you must refresh this page
Invariant Analysis For Multi Agent Graph Transformation Systems Using K Induction
DOWNLOAD
Author : Sven Schneider
language : en
Publisher: Universitätsverlag Potsdam
Release Date : 2022-11-17
Invariant Analysis For Multi Agent Graph Transformation Systems Using K Induction written by Sven Schneider and has been published by Universitätsverlag Potsdam this book supported file pdf, txt, epub, kindle and other format this book has been release on 2022-11-17 with Computers categories.
The analysis of behavioral models such as Graph Transformation Systems (GTSs) is of central importance in model-driven engineering. However, GTSs often result in intractably large or even infinite state spaces and may be equipped with multiple or even infinitely many start graphs. To mitigate these problems, static analysis techniques based on finite symbolic representations of sets of states or paths thereof have been devised. We focus on the technique of k-induction for establishing invariants specified using graph conditions. To this end, k-induction generates symbolic paths backwards from a symbolic state representing a violation of a candidate invariant to gather information on how that violation could have been reached possibly obtaining contradictions to assumed invariants. However, GTSs where multiple agents regularly perform actions independently from each other cannot be analyzed using this technique as of now as the independence among backward steps may prevent the gathering of relevant knowledge altogether. In this paper, we extend k-induction to GTSs with multiple agents thereby supporting a wide range of additional GTSs. As a running example, we consider an unbounded number of shuttles driving on a large-scale track topology, which adjust their velocity to speed limits to avoid derailing. As central contribution, we develop pruning techniques based on causality and independence among backward steps and verify that k-induction remains sound under this adaptation as well as terminates in cases where it did not terminate before.
K Inductive Invariant Checking For Graph Transformation Systems
DOWNLOAD
Author : Dyck, Johannes
language : en
Publisher: Universitätsverlag Potsdam
Release Date : 2017-09-15
K Inductive Invariant Checking For Graph Transformation Systems written by Dyck, Johannes and has been published by Universitätsverlag Potsdam this book supported file pdf, txt, epub, kindle and other format this book has been release on 2017-09-15 with categories.
While offering significant expressive power, graph transformation systems often come with rather limited capabilities for automated analysis, particularly if systems with many possible initial graphs and large or infinite state spaces are concerned. One approach that tries to overcome these limitations is inductive invariant checking. However, the verification of inductive invariants often requires extensive knowledge about the system in question and faces the approach-inherent challenges of locality and lack of context. To address that, this report discusses k-inductive invariant checking for graph transformation systems as a generalization of inductive invariants. The additional context acquired by taking multiple (k) steps into account is the key difference to inductive invariant checking and is often enough to establish the desired invariants without requiring the iterative development of additional properties. To analyze possibly infinite systems in a finite fashion, we introduce a symbolic encoding for transformation traces using a restricted form of nested application conditions. As its central contribution, this report then presents a formal approach and algorithm to verify graph constraints as k-inductive invariants. We prove the approach's correctness and demonstrate its applicability by means of several examples evaluated with a prototypical implementation of our algorithm.
Graph Transformation
DOWNLOAD
Author : Nicolas Behr
language : en
Publisher: Springer Nature
Release Date : 2022-06-30
Graph Transformation written by Nicolas Behr and has been published by Springer Nature this book supported file pdf, txt, epub, kindle and other format this book has been release on 2022-06-30 with Computers categories.
This book constitutes the refereed proceedings of the 15th International Conference on Graph Transformation, ICGT 2022, which took place Nantes, France in July 2022. The 10 full papers and 1 tool paper presented in this book were carefully reviewed and selected from 19 submissions. The conference focuses on describing new unpublished contributions in the theory and applications of graph transformation as well as tool presentation papers that demonstrate main new features and functionalities of graph-based tools.
Graph Transformation
DOWNLOAD
Author : Russ Harmer
language : en
Publisher: Springer Nature
Release Date :
Graph Transformation written by Russ Harmer and has been published by Springer Nature this book supported file pdf, txt, epub, kindle and other format this book has been release on with categories.
Modeling And Formal Analysis Of Meta Ecosystems With Dynamic Structure Using Graph Transformation
DOWNLOAD
Author : Boris Flotterer
language : en
Publisher: Universitätsverlag Potsdam
Release Date : 2023-01-08
Modeling And Formal Analysis Of Meta Ecosystems With Dynamic Structure Using Graph Transformation written by Boris Flotterer and has been published by Universitätsverlag Potsdam this book supported file pdf, txt, epub, kindle and other format this book has been release on 2023-01-08 with Computers categories.
The dynamics of ecosystems is of crucial importance. Various model-based approaches exist to understand and analyze their internal effects. In this paper, we model the space structure dynamics and ecological dynamics of meta-ecosystems using the formal technique of Graph Transformation (short GT). We build GT models to describe how a meta-ecosystem (modeled as a graph) can evolve over time (modeled by GT rules) and to analyze these GT models with respect to qualitative properties such as the existence of structural stabilities. As a case study, we build three GT models describing the space structure dynamics and ecological dynamics of three different savanna meta-ecosystems. The first GT model considers a savanna meta-ecosystem that is limited in space to two ecosystem patches, whereas the other two GT models consider two savanna meta-ecosystems that are unlimited in the number of ecosystem patches and only differ in one GT rule describing how the space structure of the meta-ecosystem grows. In the first two GT models, the space structure dynamics and ecological dynamics of the meta-ecosystem shows two main structural stabilities: the first one based on grassland-savanna-woodland transitions and the second one based on grassland-desert transitions. The transition between these two structural stabilities is driven by high-intensity fires affecting the tree components. In the third GT model, the GT rule for savanna regeneration induces desertification and therefore a collapse of the meta-ecosystem. We believe that GT models provide a complementary avenue to that of existing approaches to rigorously study ecological phenomena.
Application And Theory Of Petri Nets And Concurrency
DOWNLOAD
Author : Lars Michael Kristensen
language : en
Publisher: Springer Nature
Release Date :
Application And Theory Of Petri Nets And Concurrency written by Lars Michael Kristensen and has been published by Springer Nature this book supported file pdf, txt, epub, kindle and other format this book has been release on with categories.
Hpi Future Soc Lab Proceedings 2018
DOWNLOAD
Author : Kaushik Rana
language : en
Publisher: Universitätsverlag Potsdam
Release Date : 2023-06-06
Hpi Future Soc Lab Proceedings 2018 written by Kaushik Rana and has been published by Universitätsverlag Potsdam this book supported file pdf, txt, epub, kindle and other format this book has been release on 2023-06-06 with Computers categories.
The “HPI Future SOC Lab” is a cooperation of the Hasso Plattner Institute (HPI) and industry partners. Its mission is to enable and promote exchange and interaction between the research community and the industry partners. The HPI Future SOC Lab provides researchers with free of charge access to a complete infrastructure of state of the art hard and software. This infrastructure includes components, which might be too expensive for an ordinary research environment, such as servers with up to 64 cores and 2 TB main memory. The offerings address researchers particularly from but not limited to the areas of computer science and business information systems. Main areas of research include cloud computing, parallelization, and In-Memory technologies. This technical report presents results of research projects executed in 2018. Selected projects have presented their results on April 17th and November 14th 2017 at the Future SOC Lab Day events.
Learning From Failure
DOWNLOAD
Author : Falco Dürsch
language : en
Publisher: Universitätsverlag Potsdam
Release Date : 2023-03-15
Learning From Failure written by Falco Dürsch and has been published by Universitätsverlag Potsdam this book supported file pdf, txt, epub, kindle and other format this book has been release on 2023-03-15 with Computers categories.
Regression testing is a widespread practice in today's software industry to ensure software product quality. Developers derive a set of test cases, and execute them frequently to ensure that their change did not adversely affect existing functionality. As the software product and its test suite grow, the time to feedback during regression test sessions increases, and impedes programmer productivity: developers wait longer for tests to complete, and delays in fault detection render fault removal increasingly difficult. Test case prioritization addresses the problem of long feedback loops by reordering test cases, such that test cases of high failure probability run first, and test case failures become actionable early in the testing process. We ask, given test execution schedules reconstructed from publicly available data, to which extent can their fault detection efficiency improved, and which technique yields the most efficient test schedules with respect to APFD? To this end, we recover regression 6200 test sessions from the build log files of Travis CI, a popular continuous integration service, and gather 62000 accompanying changelists. We evaluate the efficiency of current test schedules, and examine the prioritization results of state-of-the-art lightweight, history-based heuristics. We propose and evaluate a novel set of prioritization algorithms, which connect software changes and test failures in a matrix-like data structure. Our studies indicate that the optimization potential is substantial, because the existing test plans score only 30% APFD. The predictive power of past test failures proves to be outstanding: simple heuristics, such as repeating tests with failures in recent sessions, result in efficiency scores of 95% APFD. The best-performing matrix-based heuristic achieves a similar score of 92.5% APFD. In contrast to prior approaches, we argue that matrix-based techniques are useful beyond the scope of effective prioritization, and enable a number of use cases involving software maintenance. We validate our findings from continuous integration processes by extending a continuous testing tool within development environments with means of test prioritization, and pose further research questions. We think that our findings are suited to propel adoption of (continuous) testing practices, and that programmers' toolboxes should contain test prioritization as an existential productivity tool.
Openhpi
DOWNLOAD
Author : Christoph Meinel
language : en
Publisher: Universitätsverlag Potsdam
Release Date : 2022-10-13
Openhpi written by Christoph Meinel and has been published by Universitätsverlag Potsdam this book supported file pdf, txt, epub, kindle and other format this book has been release on 2022-10-13 with Computers categories.
On the occasion of the 10th openHPI anniversary, this technical report provides information about the HPI MOOC platform, including its core features, technology, and architecture. In an introduction, the platform family with all partner platforms is presented; these now amount to nine platforms, including openHPI. This section introduces openHPI as an advisor and research partner in various projects. In the second chapter, the functionalities and common course formats of the platform are presented. The functionalities are divided into learner and admin features. The learner features section provides detailed information about performance records, courses, and the learning materials of which a course is composed: videos, texts, and quizzes. In addition, the learning materials can be enriched by adding external exercise tools that communicate with the HPI MOOC platform via the Learning Tools Interoperability (LTI) standard. Furthermore, the concept of peer assessments completed the possible learning materials. The section then proceeds with further information on the discussion forum, a fundamental concept of MOOCs compared to traditional e-learning offers. The section is concluded with a description of the quiz recap, learning objectives, mobile applications, gameful learning, and the help desk. The next part of this chapter deals with the admin features. The described functionality is restricted to describing the news and announcements, dashboards and statistics, reporting capabilities, research options with A/B testing, the course feed, and the TransPipe tool to support the process of creating automated or manual subtitles. The platform supports a large variety of additional features, but a detailed description of these features goes beyond the scope of this report. The chapter then elaborates on common course formats and openHPI teaching activities at the HPI. The chapter concludes with some best practices for course design and delivery. The third chapter provides insights into the technology and architecture behind openHPI. A special characteristic of the openHPI project is the conscious decision to operate the complete application from bare metal to platform development. Hence, the chapter starts with a section about the openHPI Cloud, including detailed information about the data center and devices, the used cloud software OpenStack and Ceph, as well as the openHPI Cloud Service provided for the HPI. Afterward, a section on the application technology stack and development tooling describes the application infrastructure components, the used automation, the deployment pipeline, and the tools used for monitoring and alerting. The chapter is concluded with detailed information about the technology stack and concrete platform implementation details. The section describes the service-oriented Ruby on Rails application, inter-service communication, and public APIs. It also provides more information on the design system and components used in the application. The section concludes with a discussion of the original microservice architecture, where we share our insights and reasoning for migrating back to a monolithic application. The last chapter provides a summary and an outlook on the future of digital education.
Probabilistic Metric Temporal Graph Logic
DOWNLOAD
Author : Sven Schneider
language : en
Publisher: Universitätsverlag Potsdam
Release Date : 2022-11-18
Probabilistic Metric Temporal Graph Logic written by Sven Schneider and has been published by Universitätsverlag Potsdam this book supported file pdf, txt, epub, kindle and other format this book has been release on 2022-11-18 with Computers categories.
Cyber-physical systems often encompass complex concurrent behavior with timing constraints and probabilistic failures on demand. The analysis whether such systems with probabilistic timed behavior adhere to a given specification is essential. When the states of the system can be represented by graphs, the rule-based formalism of Probabilistic Timed Graph Transformation Systems (PTGTSs) can be used to suitably capture structure dynamics as well as probabilistic and timed behavior of the system. The model checking support for PTGTSs w.r.t. properties specified using Probabilistic Timed Computation Tree Logic (PTCTL) has been already presented. Moreover, for timed graph-based runtime monitoring, Metric Temporal Graph Logic (MTGL) has been developed for stating metric temporal properties on identified subgraphs and their structural changes over time. In this paper, we (a) extend MTGL to the Probabilistic Metric Temporal Graph Logic (PMTGL) by allowing for the specification of probabilistic properties, (b) adapt our MTGL satisfaction checking approach to PTGTSs, and (c) combine the approaches for PTCTL model checking and MTGL satisfaction checking to obtain a Bounded Model Checking (BMC) approach for PMTGL. In our evaluation, we apply an implementation of our BMC approach in AutoGraph to a running example.