Sciweavers

199 search results - page 32 / 40
» A Fully Abstract Model for Graph-Interpreted Temporal Logic
Sort
View
114
Voted
CONCUR
2009
Springer
15 years 5 months ago
Time-Bounded Verification
Abstract. We study the decidability and complexity of verification problems for timed automata over time intervals of fixed, bounded length. One of our main results is that time-bo...
Joël Ouaknine, Alexander Rabinovich, James Wo...
104
Voted
ATVA
2009
Springer
142views Hardware» more  ATVA 2009»
15 years 8 months ago
Synthesis of Fault-Tolerant Distributed Systems
Abstract. A distributed system is fault-tolerant if it continues to perform correctly even when a subset of the processes becomes faulty. Faulttolerance is highly desirable but oft...
Rayna Dimitrova, Bernd Finkbeiner
P2PKM
2004
15 years 3 months ago
Coordinating Mobile Databases
Abstract. We are interested in the development of a database management layer which is completely portable and, therefore, "pluggable" on top of multiple host platforms. ...
Fausto Giunchiglia, Ilya Zaihrayeu
AEI
2010
136views more  AEI 2010»
15 years 1 months ago
Bridging the sense-reasoning gap: DyKnow - Stream-based middleware for knowledge processing
nizing multiple forms of information and knowledge processing on different levels of abstraction in a structured and principled manner. We propose knowledge processing middleware a...
Fredrik Heintz, Jonas Kvarnström, Patrick Doh...
CSFW
2005
IEEE
15 years 7 months ago
Nomad: A Security Model with Non Atomic Actions and Deadlines
Modelling security policies requires means to specify permissions and prohibitions. However, this is generally not sufficient to express security properties such as availability ...
Frédéric Cuppens, Nora Cuppens-Boula...