Sciweavers

498 search results - page 2 / 100
» A Theory of Complexity for Continuous Time Systems
Sort
View
AUTONOMICS
2008
ACM
13 years 9 months ago
On modeling of self-organizing systems
A goal of computing and networking systems is to limit administrative requirements for users and operators. A technical systems should be able to configure itself as much as possi...
Richard Holzer, Hermann de Meer
FROCOS
2007
Springer
14 years 1 months ago
Hierarchical and Modular Reasoning in Complex Theories: The Case of Local Theory Extensions
Abstract. We present an overview of results on hierarchical and modular reasoning in complex theories. We show that for a special type of extensions of a base theory, which we call...
Viorica Sofronie-Stokkermans
ECBS
2010
IEEE
209views Hardware» more  ECBS 2010»
13 years 11 months ago
Continuous Verification of Large Embedded Software Using SMT-Based Bounded Model Checking
The complexity of software in embedded systems has increased significantly over the last years so that software verification now plays an important role in ensuring the overall pr...
Lucas Cordeiro, Bernd Fischer 0002, João Ma...
JAIR
2006
110views more  JAIR 2006»
13 years 7 months ago
Modelling Mixed Discrete-Continuous Domains for Planning
In this paper we present pddl+, a planning domain description language for modelling mixed discrete-continuous planning domains. We describe the syntax and modelling style of pddl...
Maria Fox, Derek Long
UMC
2000
13 years 11 months ago
Upper and Lower Bounds on Continuous-Time Computation
Abstract. We consider various extensions and modifications of Shannon's General Purpose Analog Computer, which is a model of computation by differential equations in continuou...
Manuel Lameiras Campagnolo, Cristopher Moore