Sciweavers

2273 search results - page 363 / 455
» On the Expressiveness and Complexity of ATL
Sort
View
CORR
2010
Springer
162views Education» more  CORR 2010»
14 years 6 months ago
Cross-Composition: A New Technique for Kernelization Lower Bounds
We introduce a new technique for proving kernelization lower bounds, called cross-composition. A classical problem L cross-composes into a parameterized problem Q if an instance o...
Hans L. Bodlaender, Bart M. P. Jansen, Stefan Krat...
ADVSE
2010
103views more  ADVSE 2010»
14 years 5 months ago
Extending Conceptual Schemas with Business Process Information
Abstract. The specification of business processes is becoming a more and more critical aspect for organizations. Such processes are specified as workflow models expressing the logi...
Marco Brambilla, Jordi Cabot, Sara Comai
CORR
2011
Springer
172views Education» more  CORR 2011»
14 years 4 months ago
Improving Strategies via SMT Solving
We consider the problem of computing numerical invariants of programs by abstract interpretation. Our method eschews two traditional sources of imprecision: (i) the use of widenin...
Thomas Martin Gawlitza, David Monniaux
CMSB
2010
Springer
14 years 4 months ago
Stochasticity in reactions: a probabilistic Boolean modeling approach
Boolean modeling frameworks have long since proved their worth for capturing and analyzing essential characteristics of complex systems. Hybrid approaches aim at exploiting the ad...
Sven Twardziok, Heike Siebert, Alexander Heyl
SCN
2011
Springer
292views Communications» more  SCN 2011»
14 years 4 months ago
Synthesis of attack actions using model checking for the verification of security protocols
Model checking cryptographic protocols have evolved to a valuable method for discovering counterintuitive security flaws, which make possible for a hostile agent to subvert the go...
Stylianos Basagiannis, Panagiotis Katsaros, Andrew...