Sciweavers

1175 search results - page 156 / 235
» Abstract computability and algebraic specification
Sort
View
FMCAD
2000
Springer
14 years 15 days ago
Automated Refinement Checking for Asynchronous Processes
Abstract. We consider the problem of refinement checking for asynchronous processes where refinement corresponds to stutter-closed language inclusion. Since an efficient algorithmi...
Rajeev Alur, Radu Grosu, Bow-Yaw Wang
DLOG
2006
13 years 10 months ago
Model checking the basic modalities of CTL with Description Logic
Abstract. Model checking is a fully automated technique for determining whether the behaviour of a finite-state reactive system satisfies a temporal logic specification. Despite th...
Shoham Ben-David, Richard J. Trefler, Grant E. Wed...
BPM
2010
Springer
191views Business» more  BPM 2010»
13 years 10 months ago
Correctness Ensuring Process Configuration: An Approach Based on Partner Synthesis
Abstract. A configurable process model describes a family of similar process models in a given domain. Such a model can be configured to obtain a specific process model that is sub...
Wil M. P. van der Aalst, Niels Lohmann, Marcello L...
CEC
2008
IEEE
13 years 9 months ago
Regulation of gene regulation - smooth binding with dynamic affinity affects evolvability
Abstract-- Understanding the evolvability of simple differentiating multicellular systems is a fundamental problem in the biology of genetic regulatory networks and in computationa...
Johannes F. Knabe, Chrystopher L. Nehaniv, Maria J...
CORR
2010
Springer
135views Education» more  CORR 2010»
13 years 9 months ago
Automatic derivation of domain terms and concept location based on the analysis of the identifiers
Abstract. Developers express the meaning of the domain ideas in specifically selected identifiers and comments that form the target implemented code. Software maintenance requires ...
Peter Václavík, Jaroslav Porubä...