Sciweavers

119 search results - page 18 / 24
» The Computational Complexity of Hybrid Temporal Logics
Sort
View
ISVC
2007
Springer
14 years 2 months ago
Building Petri Nets from Video Event Ontologies
Video event understanding requires a formalism that can model complex logical temporal and spatial relations between composing sub-events. In this paper we argue that the Petri-Net...
Gal Lavee, Artyom Borzin, Ehud Rivlin, Michael Rud...
WWW
2006
ACM
14 years 1 months ago
ASDL: a wide spectrum language for designing web services
A Service oriented system emerges from composition of services. Dynamically composed reactive Web services form a special class of service oriented system, where the delays associ...
Monika Solanki, Antonio Cau, Hussein Zedan
WOLLIC
2010
Springer
14 years 28 days ago
Modal Logics with Counting
Abstract. We present a modal language that includes explicit operators to count the number of elements that a model might include in the extension of a formula, and we discuss how ...
Carlos Areces, Guillaume Hoffmann, Alexandre Denis
CONCUR
2009
Springer
13 years 11 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...
LOGCOM
2006
90views more  LOGCOM 2006»
13 years 7 months ago
ATL Satisfiability is Indeed EXPTIME-complete
The Alternating-time Temporal Logic (ATL) of Alur, Henzinger, and Kupferman is being increasingly widely applied in the specification and verification of open distributed systems ...
Dirk Walther, Carsten Lutz, Frank Wolter, Michael ...