7988 search results - page 7 / 1598 » A Useful Undecidable Theory |
DNA
2007
Springer
14 years 1 months ago
2007
Springer
In search for “realistic” bio-inspired computing models, we consider asynchronous spiking neural P systems, in the hope to get a class of computing devices with decidable prope...
FORMATS
2007
Springer
14 years 1 months ago
2007
Springer
Timed automata were introduced by Alur and Dill in the early 1990s and have since become the most prominent modelling formalism for real-time systems. A fundamental limit to the al...
IANDC
2007
13 years 7 months ago
2007
We present a model, task automata, for real time systems with non-uniformly recurring computation tasks. It is an extended version of timed automata with asynchronous processes th...
ATVA
2006
Springer
13 years 11 months ago
2006
Springer
Testing is one of the fundamental techniques for verifying if a computing system conforms to its specification. We take a fresh look at the theory of testing for message-passing sy...
ECAI
2010
Springer
13 years 8 months ago
2010
Springer
Abstract. Interval temporal logics formalize reasoning about interval structures over (usually) linearly ordered domains, where time intervals are the primitive ontological entitie...