Probalistic Timed Graph Transformation Systems

Author : Maximove, Maria,Giese, Holger,Krause, Christian
Publisher : Universitätsverlag Potsdam
Page : 40 pages
File Size : 49,7 Mb
Release : 2017-11-30
Category : Electronic
ISBN : 9783869564050

Get Book

Probalistic Timed Graph Transformation Systems by Maximove, Maria,Giese, Holger,Krause, Christian Pdf

Today, software has become an intrinsic part of complex distributed embedded real-time systems. The next generation of embedded real-time systems will interconnect the today unconnected systems via complex software parts and the service-oriented paradigm. Therefore besides timed behavior and probabilistic behaviour also structure dynamics, where the architecture can be subject to changes at run-time, e.g. when dynamic binding of service end-points is employed or complex collaborations are established dynamically, is required. However, a modeling and analysis approach that combines all these necessary aspects does not exist so far. To fill the identified gap, we propose Probabilistic Timed Graph Transformation Systems (PTGTSs) as a high-level description language that supports all the necessary aspects of structure dynamics, timed behavior, and probabilistic behavior. We introduce the formal model of PTGTSs in this paper and present a mapping of models with finite state spaces to probabilistic timed automata (PTA) that allows to use the PRISM model checker to analyze PTGTS models with respect to PTCTL properties.

Author : Maria Maximova,Holger Giese,Sven Schneider
Publisher : Universitätsverlag Potsdam
Page : 64 pages
File Size : 51,5 Mb
Release : 2022-05-19
Category : Computers
ISBN : 9783869565026

Get Book

Interval Probabilistic Timed Graph Transformation Systems by Maria Maximova,Holger Giese,Sven Schneider Pdf

The formal modeling and analysis is of crucial importance for software development processes following the model based approach. We present the formalism of Interval Probabilistic Timed Graph Transformation Systems (IPTGTSs) as a high-level modeling language. This language supports structure dynamics (based on graph transformation), timed behavior (based on clocks, guards, resets, and invariants as in Timed Automata (TA)), and interval probabilistic behavior (based on Discrete Interval Probability Distributions). That is, for the probabilistic behavior, the modeler using IPTGTSs does not need to provide precise probabilities, which are often impossible to obtain, but rather provides a probability range instead from which a precise probability is chosen nondeterministically. In fact, this feature on capturing probabilistic behavior distinguishes IPTGTSs from Probabilistic Timed Graph Transformation Systems (PTGTSs) presented earlier. Following earlier work on Interval Probabilistic Timed Automata (IPTA) and PTGTSs, we also provide an analysis tool chain for IPTGTSs based on inter-formalism transformations. In particular, we provide in our tool AutoGraph a translation of IPTGTSs to IPTA and rely on a mapping of IPTA to Probabilistic Timed Automata (PTA) to allow for the usage of the Prism model checker. The tool Prism can then be used to analyze the resulting PTA w.r.t. probabilistic real-time queries asking for worst-case and best-case probabilities to reach a certain set of target states in a given amount of time.

Author : Maria Maximova,Holger Giese,Sven Schneider
Publisher : Universitätsverlag Potsdam
Page : 60 pages
File Size : 45,7 Mb
Release : 2022-05-19
Category : Computers
ISBN : 9783869565019

Get Book

Compositional Analysis of Probabilistic Timed Graph Transformation Systems by Maria Maximova,Holger Giese,Sven Schneider Pdf

The analysis of behavioral models is of high importance for cyber-physical systems, as the systems often encompass complex behavior based on e.g. concurrent components with mutual exclusion or probabilistic failures on demand. The rule-based formalism of probabilistic timed graph transformation systems is a suitable choice when the models representing states of the system can be understood as graphs and timed and probabilistic behavior is important. However, model checking PTGTSs is limited to systems with rather small state spaces. We present an approach for the analysis of large scale systems modeled as probabilistic timed graph transformation systems by systematically decomposing their state spaces into manageable fragments. To obtain qualitative and quantitative analysis results for a large scale system, we verify that results obtained for its fragments serve as overapproximations for the corresponding results of the large scale system. Hence, our approach allows for the detection of violations of qualitative and quantitative safety properties for the large scale system under analysis. We consider a running example in which we model shuttles driving on tracks of a large scale topology and for which we verify that shuttles never collide and are unlikely to execute emergency brakes. In our evaluation, we apply an implementation of our approach to the running example.

Author : Sven Schneider,Maria Maximova,Holger Giese
Publisher : Universitätsverlag Potsdam
Page : 40 pages
File Size : 43,9 Mb
Release : 2022-11-18
Category : Computers
ISBN : 9783869565323

Get Book

Probabilistic metric temporal graph logic by Sven Schneider,Maria Maximova,Holger Giese Pdf

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.

Author : Fabio Gadducci,Timo Kehrer
Publisher : Springer Nature
Page : 311 pages
File Size : 48,7 Mb
Release : 2021-06-17
Category : Computers
ISBN : 9783030789466

Get Book

Graph Transformation by Fabio Gadducci,Timo Kehrer Pdf

This book constitutes the refereed proceedings of the 14th International Conference on Graph Transformation, ICGT 2021, which took place virtually during June 24-25, 2021. The 14 full papers and 2 tool papers presented in this book were carefully reviewed and selected from 26 submissions. They deal with the following topics: theoretical advances; application domains; and tool presentations.

Author : Juan de Lara,Detlef Plump
Publisher : Springer
Page : 239 pages
File Size : 52,6 Mb
Release : 2017-07-03
Category : Computers
ISBN : 9783319614700

Get Book

Graph Transformation by Juan de Lara,Detlef Plump Pdf

This book constitutes the refereed proceedings of the 10th International Conference on Graph Transformation, ICGT 2017, held as part of STAF 2017, in Marburg, Germany, in July 2017. The 14 papers presented were carefully reviewed and selected from 23 submissions. The papers cover a wide range of topics including theoretical approaches to graph transformation and their verification, model-driven engineering, chemical reactions as well as various applications. They are organized in the following topical sections: foundations; graph language and parsing; analysis and verification; and model transformation and tools.

Author : Nicolas Behr,Daniel Strüber
Publisher : Springer Nature
Page : 216 pages
File Size : 42,8 Mb
Release : 2022-06-30
Category : Computers
ISBN : 9783031098437

Get Book

Graph Transformation by Nicolas Behr,Daniel Strüber Pdf

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.

Author : Sven Schneider,Maria Maximova,Holger Giese
Publisher : Universitätsverlag Potsdam
Page : 44 pages
File Size : 54,8 Mb
Release : 2022-11-17
Category : Computers
ISBN : 9783869565316

Get Book

Invariant Analysis for Multi-Agent Graph Transformation Systems using k-Induction by Sven Schneider,Maria Maximova,Holger Giese Pdf

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.

Author : Krause, Christian,Giese, Holger
Publisher : Universitätsverlag Potsdam
Page : 54 pages
File Size : 46,5 Mb
Release : 2012
Category : Computers
ISBN : 9783869561714

Get Book

Quantitative Modeling and Analysis of Service-oriented Real-time Systems Using Interval Probabilistic Timed Automata by Krause, Christian,Giese, Holger Pdf

One of the key challenges in service-oriented systems engineering is the prediction and assurance of non-functional properties, such as the reliability and the availability of composite interorganizational services. Such systems are often characterized by a variety of inherent uncertainties, which must be addressed in the modeling and the analysis approach. The different relevant types of uncertainties can be categorized into (1) epistemic uncertainties due to incomplete knowledge and (2) randomization as explicitly used in protocols or as a result of physical processes. In this report, we study a probabilistic timed model which allows us to quantitatively reason about nonfunctional properties for a restricted class of service-oriented real-time systems using formal methods. To properly motivate the choice for the used approach, we devise a requirements catalogue for the modeling and the analysis of probabilistic real-time systems with uncertainties and provide evidence that the uncertainties of type (1) and (2) in the targeted systems have a major impact on the used models and require distinguished analysis approaches. The formal model we use in this report are Interval Probabilistic Timed Automata (IPTA). Based on the outlined requirements, we give evidence that this model provides both enough expressiveness for a realistic and modular specifiation of the targeted class of systems, and suitable formal methods for analyzing properties, such as safety and reliability properties in a quantitative manner. As technical means for the quantitative analysis, we build on probabilistic model checking, specifically on probabilistic time-bounded reachability analysis and computation of expected reachability rewards and costs. To carry out the quantitative analysis using probabilistic model checking, we developed an extension of the Prism tool for modeling and analyzing IPTA. Our extension of Prism introduces a means for modeling probabilistic uncertainty in the form of probability intervals, as required for IPTA. For analyzing IPTA, our Prism extension moreover adds support for probabilistic reachability checking and computation of expected rewards and costs. We discuss the performance of our extended version of Prism and compare the interval-based IPTA approach to models with fixed probabilities.

Author : Esther Guerra,Mariëlle Stoelinga
Publisher : Springer Nature
Page : 373 pages
File Size : 47,6 Mb
Release : 2021-04-20
Category : Computers
ISBN : 9783030715007

Get Book

Fundamental Approaches to Software Engineering by Esther Guerra,Mariëlle Stoelinga Pdf

This open access book constitutes the proceedings of the 24th International Conference on Fundamental Approaches to Software Engineering, FASE 2021, which took place during March 27–April 1, 2021, and was held as part of the Joint Conferences on Theory and Practice of Software, ETAPS 2021. The conference was planned to take place in Luxembourg but changed to an online format due to the COVID-19 pandemic. The 16 full papers presented in this volume were carefully reviewed and selected from 52 submissions. The book also contains 4 Test-Comp contributions.

Author : Dyck, Johannes,Giese, Holger
Publisher : Universitätsverlag Potsdam
Page : 52 pages
File Size : 46,5 Mb
Release : 2017-09-15
Category : Electronic
ISBN : 9783869564067

Get Book

k-Inductive invariant checking for graph transformation systems by Dyck, Johannes,Giese, Holger Pdf

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.

Author : Dirk Beyer
Publisher : Springer Nature
Page : 346 pages
File Size : 47,6 Mb
Release : 2024-07-02
Category : Electronic
ISBN : 9783031572593

Get Book

Fundamental Approaches to Software Engineering by Dirk Beyer Pdf

Author : Giese, Holger,Maximova, Maria,Sakizloglou, Lucas,Schneider, Sven
Publisher : Universitätsverlag Potsdam
Page : 38 pages
File Size : 51,7 Mb
Release : 2019
Category : Computers
ISBN : 9783869564630

Get Book

Metric Temporal Graph Logic over Typed Attributed Graphs by Giese, Holger,Maximova, Maria,Sakizloglou, Lucas,Schneider, Sven Pdf

Graph repair, restoring consistency of a graph, plays a prominent role in several areas of computer science and beyond: For example, in model-driven engineering, the abstract syntax of models is usually encoded using graphs. Flexible edit operations temporarily create inconsistent graphs not representing a valid model, thus requiring graph repair. Similarly, in graph databases—managing the storage and manipulation of graph data—updates may cause that a given database does not satisfy some integrity constraints, requiring also graph repair. We present a logic-based incremental approach to graph repair, generating a sound and complete (upon termination) overview of least-changing repairs. In our context, we formalize consistency by so-called graph conditions being equivalent to first-order logic on graphs. We present two kind of repair algorithms: State-based repair restores consistency independent of the graph update history, whereas deltabased (or incremental) repair takes this history explicitly into account. Technically, our algorithms rely on an existing model generation algorithm for graph conditions implemented in AutoGraph. Moreover, the delta-based approach uses the new concept of satisfaction (ST) trees for encoding if and how a graph satisfies a graph condition. We then demonstrate how to manipulate these STs incrementally with respect to a graph update.

Author : Leen Lambers,Jens Weber
Publisher : Springer
Page : 188 pages
File Size : 54,9 Mb
Release : 2018-06-18
Category : Computers
ISBN : 9783319929910

Get Book

Graph Transformation by Leen Lambers,Jens Weber Pdf

This book constitutes the refereed proceedings of the 11th International Conference on Graph Transformation, ICGT 2018, held as part of STAF 2018, in Toulouse, France, in June 2018. The 9 full papers, 2 short papers and 1 keynote presented in this book were carefully reviewed and selected from 16 submissions. The papers deal with the following topics: graph languages; graph transformation formalisms; parallel independence and conflicts; and graph conditions and verification.​

Author : Holger Giese,Maria Maximova,Lucas Sakizloglou,Sven Schneider
Publisher : Universitätsverlag Potsdam
Page : 36 pages
File Size : 41,5 Mb
Release : 2018
Category : Computers
ISBN : 9783869564333

Get Book

Metric Temporal Graph Logic over Typed Attributed Graphs by Holger Giese,Maria Maximova,Lucas Sakizloglou,Sven Schneider Pdf

Various kinds of typed attributed graphs are used to represent states of systems from a broad range of domains. For dynamic systems, established formalisms such as graph transformations provide a formal model for defining state sequences. We consider the extended case where time elapses between states and introduce a logic to reason about these sequences. With this logic we express properties on the structure and attributes of states as well as on the temporal occurrence of states that are related by their inner structure, which no formal logic over graphs accomplishes concisely so far. Firstly, we introduce graphs with history by equipping every graph element with the timestamp of its creation and, if applicable, its deletion. Secondly, we define a logic on graphs by integrating the temporal operator until into the well-established logic of nested graph conditions. Thirdly, we prove that our logic is equally expressive to nested graph conditions by providing a suitable reduction. Finally, the implementation of this reduction allows for the tool-based analysis of metric temporal properties for state sequences. Verschiedene Arten von getypten attributierten Graphen werden benutzt, um Zustände von Systemen in vielen unterschiedlichen Anwendungsbereichen zu beschreiben. Der etablierte Formalismus der Graphtransformationen bietet ein formales Model, um Zustandssequenzen für dynamische Systeme zu definieren. Wir betrachten den erweiterten Fall von solchen Sequenzen, in dem Zeit zwischen zwei verschiedenen Systemzuständen vergeht, und führen eine Logik ein, um solche Sequenzen zu beschreiben. Mit dieser Logik drücken wir zum einen Eigenschaften über die Struktur und die Attribute von Zuständen aus und beschreiben zum anderen temporale Vorkommen von Zuständen, die durch ihre innere Struktur verbunden sind. Solche Eigenschaften können bisher von keiner der existierenden Logiken auf Graphen vergleichbar darstellt werden. Erstens führen wir Graphen mit Änderungshistorie ein, indem wir jedes Graphelement mit einem Zeitstempel seiner Erzeugung und, wenn nötig, seiner Löschung versehen. Zweitens definieren wir eine Logik auf Graphen, indem wir den Temporaloperator Until in die wohl-etablierte Logik der verschachtelten Graphbedingungen integrieren. Drittens beweisen wir, dass unsere Logik gleich ausdrucksmächtig ist, wie die Logik der verschachtelten Graphbedingungen, indem wir eine passende Reduktionsoperation definieren. Zuletzt erlaubt uns die Implementierung dieser Reduktionsoperation die werkzeukbasierte Analyse von metrisch-temporallogischen Eigenschaften für Zustandssequenzen zu führen.