Probabilistic Graph Transformation Systems
نویسندگان
چکیده
In the recent years, extensions of graph transformation systems with quantitative properties, such as real-time and stochastic behavior received considerable attention. In this paper, we describe the new quantitative modeling approach of probabilistic graph transformation systems (PGTSs) which incorporate probabilistic behavior into graph transformation systems. Among other applications, PGTSs permit to model randomized protocols in distributed and mobile systems, and systems with on-demand probabilistic failures, such as message losses in unreliable communication media. We define the semantics of PGTSs in terms of Markov decision processes and employ probabilistic model checking for the quantitative analysis of finite-state PGTS models. We present tool support using Henshin and Prism for the modeling and analysis and discuss a probabilistic broadcast case study for wireless sensor networks.
منابع مشابه
Invited Talk: Extensions of Graph Transformation Systems for Timed, Continuous, and Probabilistic Behavior
Graph transformation systems can be employed to describe systems with complex structural dynamics which states can be captured by attributed graphs. However, like many other standard computer science models such as automata in their basic form time, continuous behavior, or probabilistic behavior are not supported. In this talk we will report on a number of extensions for graph transformation sy...
متن کاملENTROPY OF DYNAMICAL SYSTEMS ON WEIGHTS OF A GRAPH
Let $G$ be a finite simple graph whose vertices and edges are weighted by two functions. In this paper we shall define and calculate entropy of a dynamical system on weights of the graph $G$, by using the weights of vertices and edges of $G$. We examine the conditions under which entropy of the dynamical system is zero, possitive or $+infty$. At the end it is shown that, for $rin [0,+infty]$, t...
متن کاملA Hybrid Meta-heuristic Approach to Cope with State Space Explosion in Model Checking Technique for Deadlock Freeness
Model checking is an automatic technique for software verification through which all reachable states are generated from an initial state to finding errors and desirable patterns. In the model checking approach, the behavior and structure of system should be modeled. Graph transformation system is a graphical formal modeling language to specify and model the system. However, modeling of large s...
متن کاملپخش بار احتمالاتی با استفاده از تبدیل بی بوی کروی
Today's with the increasing development of distributed energy resources, power system analysis has been entered a new level of attention. Since the majority of these types of energy resources are affected by environmental conditions, the uncertainty in the power system has been expanded; so probabilistic analysis has become more important. Among the various methods of probabilistic analysis, po...
متن کاملLPKP: location-based probabilistic key pre-distribution scheme for large-scale wireless sensor networks using graph coloring
Communication security of wireless sensor networks is achieved using cryptographic keys assigned to the nodes. Due to resource constraints in such networks, random key pre-distribution schemes are of high interest. Although in most of these schemes no location information is considered, there are scenarios that location information can be obtained by nodes after their deployment. In this paper,...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2012