Stochastic Object-Based Graph Grammars | Zendy

Odorico Machado Mendizabal | Zendy; Fernando Luís Dotti | Zendy; Leila Ribeiro | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Stochastic Object-Based Graph Grammars

Author(s) -

Odorico Machado Mendizabal,

Fernando Luís Dotti,

Leila Ribeiro

Publication year - 2007

Publication title -

electronic notes in theoretical computer science

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.242

H-Index - 60

ISSN - 1571-0661

DOI - 10.1016/j.entcs.2007.03.020

Subject(s) - computer science , theoretical computer science , automaton , formalism (music) , asynchronous communication , rule based machine translation , markov chain , graph , graph rewriting , programming language , artificial intelligence , machine learning , art , musical , computer network , visual arts

Object-Based Graph Grammar (OBGG) is a formal visual language suited to the specification of asynchronous distributed systems based on message passing. Model-checking of OBGG models is currently supported and a series of case studies have been developed. However, in many situations one has to evaluate non-functional aspects like availability and performance of the system under consideration. In such cases, a stochastic analysis of the system is desired. This paper is a first contribution to the stochastic analysis of OBGG models. OBGG models with occurrence rates associated to rules are translated to Stochastic Automata Networks (SAN). SAN is a Markov Chain equivalent formalism having as advantage its modularity in terms of representation and a compact mathematical solution, allowing the analysis of models with larger state space

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research