Sciweavers

103 search results - page 6 / 21
» Termination Criteria for Model Transformation
Sort
View
EPK
2006
114views Management» more  EPK 2006»
15 years 1 months ago
Verifying Properties of (Timed) Event Driven Process Chains by Transformation to Hybrid Automata
Abstract: Event-driven Process Chains (EPCs) are a commonly used modelling technique for design and documentation of business processes. Although EPCs have an easy-to-understand no...
Stefan Denne
POPL
2005
ACM
15 years 12 months ago
Transition predicate abstraction and fair termination
on Predicate Abstraction and Fair Termination Andreas Podelski Andrey Rybalchenko Max-Planck-Institut f?ur Informatik Saarbr?ucken, Germany Predicate abstraction is the basis of m...
Andreas Podelski, Andrey Rybalchenko
ICASSP
2009
IEEE
15 years 6 months ago
Joint map adaptation of feature transformation and Gaussian Mixture Model for speaker recognition
This paper extends our previous work on feature transformationbased support vector machines for speaker recognition by proposing a joint MAP adaptation of feature transformation (...
Donglai Zhu, Bin Ma, Haizhou Li
GG
2010
Springer
14 years 10 months ago
Formal Analysis of Functional Behaviour for Model Transformations Based on Triple Graph Grammars
Abstract. Triple Graph Grammars (TGGs) are a well-established concept for the specification of model transformations. In previous work we have formalized and analyzed already cruc...
Frank Hermann, Hartmut Ehrig, Fernando Orejas, Ulr...
CONCUR
2006
Springer
15 years 3 months ago
Proving Liveness by Backwards Reachability
Abstract. We present a new method for proving liveness and termination properties for fair concurrent programs, which does not rely on finding a ranking function or on computing th...
Parosh Aziz Abdulla, Bengt Jonsson, Ahmed Rezine, ...