Sciweavers

1357 search results - page 58 / 272
» Compositionality in Graph Transformation
Sort
View
135
Voted
INFORMATICALT
2000
160views more  INFORMATICALT 2000»
15 years 2 months ago
An Algorithm for Transformation of Finite Automata to Regular Expressions
An original algorithm for transformation of finite automata to regular expressions is presented. This algorithm is based on effective graph algorithms and gives a transparent new p...
Larisa Stanevichene, Aleksei Vylitok
CONCUR
2004
Springer
15 years 8 months ago
Verifying Finite-State Graph Grammars: An Unfolding-Based Approach
We propose a framework where behavioural properties of finite-state systems modelled as graph transformation systems can be expressed and verified. The technique is based on the ...
Paolo Baldan, Andrea Corradini, Barbara König
BIRTHDAY
2008
Springer
15 years 4 months ago
Graph-Based Design and Analysis of Dynamic Software Architectures
We illustrate two ways to address the specification, modelling and analysis of dynamic software architectures using: i) ordinary typed graph transformation techniques implemented i...
Roberto Bruni, Antonio Bucchiarone, Stefania Gnesi...
136
Voted
ICWS
2008
IEEE
15 years 4 months ago
Generalized Semantics-Based Service Composition
Service-oriented computing (SOC) has emerged as the eminent market environment for sharing and reusing service-centric capabilities. The underpinning for an organization's us...
Srividya Kona, Ajay Bansal, M. Brian Blake, Gopal ...
116
Voted
TIME
2007
IEEE
15 years 9 months ago
Temporal Relations of Intervals with a Gap
Forty-four relations are found between an interval and an interval with a gap ( rIIg ), capturing semantics that are distinct from those of the sets of constituting intervals and ...
Max J. Egenhofer