scholarly journals Compositional Analysis of Probabilistic Timed Graph Transformation Systems

2021 ◽  
Author(s):  
Sven Schneider ◽  
Maria Maximova ◽  
Holger Giese
Keyword(s):  
Graph Transformation ◽  
Compositional Analysis ◽  
Transformation Systems ◽  
Graph Transformation Systems

scholarly journals Compositional Analysis of Probabilistic Timed Graph Transformation Systems

2021 ◽  
pp. 196-217
Author(s):  
Maria Maximova ◽  
Sven Schneider ◽  
Holger Giese
Keyword(s):  
Large Scale ◽  
Graph Transformation ◽  
Mutual Exclusion ◽  
Compositional Analysis ◽  
Behavioral Models ◽  
State Spaces ◽  
Large Scale System ◽  
Qualitative And Quantitative ◽  
Transformation Systems ◽  
Graph Transformation Systems

AbstractThe 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.

A NOVEL APPROACH TO VERIFY GRAPH SCHEMA-BASED SOFTWARE SYSTEMS

2009 ◽  
Vol 19 (06) ◽  
pp. 857-870 ◽  
Author(s):  
VAHID RAFE ◽  
ADEL T. RAHMANI
Keyword(s):  
Graph Transformation ◽  
Behavioral Modeling ◽  
Model Transformations ◽  
Software Systems ◽  
Hierarchical Systems ◽  
Input Language ◽  
Novel Approach ◽  
Graph Schema ◽  
Transformation Systems ◽  
Graph Transformation Systems

Graph Grammars have recently become more and more popular as a general formal modeling language. Behavioral modeling of dynamic systems and model to model transformations are a few well-known examples in which graphs have proven their usefulness in software engineering. A special type of graph transformation systems is layered graphs. Layered graphs are a suitable formalism for modeling hierarchical systems. However, most of the research so far concentrated on graph transformation systems as a modeling means, without considering the need for suitable analysis tools. In this paper we concentrate on how to analyze these models. We will describe our approach to show how one can verify the designed graph transformation systems. To verify graph transformation systems we use a novel approach: using Bogor model checker to verify graph transformation systems. The AGG-like graph transformation systems are translated to BIR — the input language of Bogor — and Bogor verifies that model against some properties defined by combining LTL and special purpose graph rules. Supporting schema-based and layered graphs characterize our approach among existing solutions for verification of graph transformation systems.

ROLES IN AGENT-ORIENTED MODELING

2001 ◽  
Vol 11 (03) ◽  
pp. 281-302 ◽  
Author(s):  
RALPH DEPKE ◽  
REIKO HECKEL ◽  
JOCHEN MALTE KÜSTER
Keyword(s):  
Graph Transformation ◽  
Systematic Analysis ◽  
General Role ◽  
Modeling Approach ◽  
Agent Design ◽  
Time Semantics ◽  
Role Concept ◽  
Run Time ◽  
Transformation Systems ◽  
Graph Transformation Systems

For the generic specification of protocols, goals, or workflows, many approaches to agent-oriented modeling provide a concept of role. Roles abstract from the concrete agents involved in an interaction. They provide means for the evolution of agents and serve as components of agent design. Despite the widespread usage of roles in agent-oriented modeling, a systematic analysis of the different aspects and properties of this concept is still missing. In this paper, we perform such an analysis and identify requirements for a general role concept. We develop such a role concept for a modeling approach based on the UML and graph transformation systems and exemplify its use for the specification (and application) of protocols. Finally, we provide a run-time semantics for roles based on concepts from the theory of graph transformation.

Sign in / Sign up

Export Citation Format

Share Document