Analysis of Infinite-State Graph Transformation Systems by Cluster Abstraction

2015 ◽  
pp. 135-152 ◽  
Author(s):  
Peter Backes ◽  
Jan Reineke
Keyword(s):  
Graph Transformation ◽  
State Graph ◽  
Transformation Systems ◽  
Graph Transformation Systems ◽  
Infinite State

scholarly journals A framework for the verification of infinite-state graph transformation systems

2008 ◽  
Vol 206 (7) ◽  
pp. 869-907 ◽  
Author(s):  
Paolo Baldan ◽  
Andrea Corradini ◽  
Barbara König
Keyword(s):  
Graph Transformation ◽  
State Graph ◽  
Transformation Systems ◽  
Graph Transformation Systems ◽  
Infinite State

Infinite-state graph transformation systems under adverse conditions

2021 ◽  
Vol 0 (0) ◽  
Author(s):  
Okan Özkan
Keyword(s):  
Model Checking ◽  
Graph Transformation ◽  
State Graph ◽  
State Spaces ◽  
Adverse Conditions ◽  
Computation Tree ◽  
Temporal Model ◽  
Transformation Systems ◽  
Graph Transformation Systems ◽  
Infinite State

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.

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.

Graph Transformation Systems for Modeling Three Dimensional Finite Element Method. Part II

2015 ◽  
Vol 140 (2) ◽  
pp. 173-203 ◽  
Author(s):  
Iwona Ryszka ◽  
Anna Paszyńska ◽  
Ewa Grabska ◽  
Marcin Sieniek ◽  
Maciej Paszyński
Keyword(s):  
Finite Element Method ◽  
Finite Element ◽  
Graph Transformation ◽  
Three Dimensional ◽  
Dimensional Finite Element ◽  
Three Dimensional Finite Element ◽  
Transformation Systems ◽  
Graph Transformation Systems ◽  
Element Method

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