Sciweavers

524 search results - page 40 / 105
» Application of Graph Transformation in Verification of Dynam...
Sort
View
POPL
2005
ACM
14 years 9 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
AR
2010
133views more  AR 2010»
13 years 7 months ago
Coordinated Control of Space Robot Teams for the On-Orbit Construction of Large Flexible Space Structures
Teams of autonomous space robots are needed for future space missions such as the construction of large solar power stations and large space telescopes in earth orbit. This work fo...
Peggy Boning, Steven Dubowsky
BMCBI
2010
233views more  BMCBI 2010»
13 years 8 months ago
Odefy -- From discrete to continuous models
Background: Phenomenological information about regulatory interactions is frequently available and can be readily converted to Boolean models. Fully quantitative models, on the ot...
Jan Krumsiek, Sebastian Pölsterl, Dominik M. ...
AMAST
2008
Springer
13 years 10 months ago
Towards an Efficient Implementation of Tree Automata Completion
Term Rewriting Systems (TRSs) are now commonly used as a modeling language for applications. In those rewriting based models, reachability analysis, i.e. proving or disproving that...
Emilie Balland, Yohan Boichut, Thomas Genet, Pierr...
FOSSACS
2008
Springer
13 years 10 months ago
Deriving Bisimulation Congruences in the Presence of Negative Application Conditions
In recent years there have been several approaches for the automatic derivation of labels from an unlabeled reactive system. This can be done in such a way that the resulting bisim...
Guilherme Rangel, Barbara König, Hartmut Ehri...