Sciweavers

1633 search results - page 238 / 327
» On the Verification of Temporal Properties
Sort
View
CSL
1999
Springer
14 years 3 months ago
A Road-Map on Complexity for Hybrid Logics
Hybrid languages are extended modal languages which can refer to (or even quantify over) states. Such languages are better behaved proof theoretically than ordinary modal languages...
Carlos Areces, Patrick Blackburn, Maarten Marx
ICPP
1997
IEEE
14 years 3 months ago
Communication in Parallel Applications: Characterization and Sensitivity Analysis
Communication characterization of parallel applications is essential to understand the interplay between architectures and applications in determining the maximum achievable perfo...
Dale Seed, Anand Sivasubramaniam, Chita R. Das
ICLP
1997
Springer
14 years 2 months ago
The Complexity of Model Checking in Modal Event Calculi
Kowalski and Sergot’s Event Calculus (EC) is a simple temporal formalism that, given a set of event occurrences, derives the maximal validity intervals (MVIs) over which propert...
Iliano Cervesato, Massimo Franceschet, Angelo Mont...
NFM
2011
306views Formal Methods» more  NFM 2011»
13 years 5 months ago
Generalized Rabin(1) Synthesis with Applications to Robust System Synthesis
Synthesis of finite-state machines from linear-time temporal logic (LTL) formulas is an important formal specification debugging technique for reactive systems and can quickly ge...
Rüdiger Ehlers
JMLR
2010
103views more  JMLR 2010»
13 years 5 months ago
Learning Nonlinear Dynamic Models from Non-sequenced Data
Virtually all methods of learning dynamic systems from data start from the same basic assumption: the learning algorithm will be given a sequence of data generated from the dynami...
Tzu-Kuo Huang, Le Song, Jeff Schneider