Sciweavers

1167 search results - page 194 / 234
» A Really Temporal Logic
Sort
View
ENTCS
2007
158views more  ENTCS 2007»
13 years 8 months ago
Abstraction and Completeness for Real-Time Maude
ion and Completeness for Real-Time Maude Peter Csaba ¨Olveczky a,b and Jos´e Meseguer b a Department of Informatics, University of Oslo b Department of Computer Science, Universi...
Peter Csaba Ölveczky, José Meseguer
JOT
2007
169views more  JOT 2007»
13 years 8 months ago
Translating AUML Diagrams into Maude Specifications: A Formal Verification of Agents Interaction Protocols
Agents Interaction Protocols (AIPs) play a crucial role in multi-agents systems development. They allow specifying sequences of messages between agents. Major proposed protocols s...
Farid Mokhati, Noura Boudiaf, Mourad Badri, Linda ...
FAC
2000
94views more  FAC 2000»
13 years 8 months ago
Maximally Concurrent Programs
Typically, program design involves constructing a program P that implements a given specification S; that is, the set P of executions of P is a subset of the set S of executions s...
Rajeev Joshi, Jayadev Misra
IVC
2008
94views more  IVC 2008»
13 years 8 months ago
Enhanced tracking and recognition of moving objects by reasoning about spatio-temporal continuity
A framework for the logical and statistical analysis and annotation of dynamic scenes containing occlusion and other uncertainties is presented. This framework consists of three e...
Brandon Bennett, Derek R. Magee, Anthony G. Cohn, ...
LICS
2010
IEEE
13 years 7 months ago
Alternating Timed Automata over Bounded Time
Alternating timed automata are a powerful extension of classical Alur-Dill timed automata that are closed under all Boolean operations. They have played a key role, among others, ...
Mark Jenkins, Joël Ouaknine, Alexander Rabino...