Probalistic Timed Graph Transformation Systems


Probalistic Timed Graph Transformation Systems
DOWNLOAD eBooks

Download Probalistic Timed Graph Transformation Systems PDF/ePub or read online books in Mobi eBooks. Click Download or Read Online button to get Probalistic Timed Graph Transformation Systems 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





Probalistic Timed Graph Transformation Systems


Probalistic Timed Graph Transformation Systems
DOWNLOAD eBooks

Author : Maximove, Maria
language : en
Publisher: Universitätsverlag Potsdam
Release Date : 2017-11-30

Probalistic Timed Graph Transformation Systems written by Maximove, Maria 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-11-30 with categories.


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.



Interval Probabilistic Timed Graph Transformation Systems


Interval Probabilistic Timed Graph Transformation Systems
DOWNLOAD eBooks

Author : Maria Maximova
language : en
Publisher: Universitätsverlag Potsdam
Release Date : 2022-05-19

Interval Probabilistic Timed Graph Transformation Systems written by Maria Maximova 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-05-19 with Computers categories.


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.



Compositional Analysis Of Probabilistic Timed Graph Transformation Systems


Compositional Analysis Of Probabilistic Timed Graph Transformation Systems
DOWNLOAD eBooks

Author : Maria Maximova
language : en
Publisher: Universitätsverlag Potsdam
Release Date : 2022-05-19

Compositional Analysis Of Probabilistic Timed Graph Transformation Systems written by Maria Maximova 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-05-19 with Computers categories.


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.



Probabilistic Metric Temporal Graph Logic


Probabilistic Metric Temporal Graph Logic
DOWNLOAD eBooks

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.



Graph Transformation


Graph Transformation
DOWNLOAD eBooks

Author : Fabio Gadducci
language : en
Publisher: Springer Nature
Release Date : 2021-06-17

Graph Transformation written by Fabio Gadducci and has been published by Springer Nature this book supported file pdf, txt, epub, kindle and other format this book has been release on 2021-06-17 with Computers categories.


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.



Graph Transformation


Graph Transformation
DOWNLOAD eBooks

Author : Juan de Lara
language : en
Publisher: Springer
Release Date : 2017-07-03

Graph Transformation written by Juan de Lara and has been published by Springer this book supported file pdf, txt, epub, kindle and other format this book has been release on 2017-07-03 with Computers categories.


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.



Graph Transformation


Graph Transformation
DOWNLOAD eBooks

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.



Invariant Analysis For Multi Agent Graph Transformation Systems Using K Induction


Invariant Analysis For Multi Agent Graph Transformation Systems Using K Induction
DOWNLOAD eBooks

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.



Fundamental Approaches To Software Engineering


Fundamental Approaches To Software Engineering
DOWNLOAD eBooks

Author : Dirk Beyer
language : en
Publisher: Springer Nature
Release Date :

Fundamental Approaches To Software Engineering written by Dirk Beyer 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.




Quantitative Modeling And Analysis Of Service Oriented Real Time Systems Using Interval Probabilistic Timed Automata


Quantitative Modeling And Analysis Of Service Oriented Real Time Systems Using Interval Probabilistic Timed Automata
DOWNLOAD eBooks

Author : Krause, Christian
language : en
Publisher: Universitätsverlag Potsdam
Release Date : 2012

Quantitative Modeling And Analysis Of Service Oriented Real Time Systems Using Interval Probabilistic Timed Automata written by Krause, Christian 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 2012 with Computers categories.


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.