Sciweavers

3653 search results - page 187 / 731
» On Recognizable Timed Languages
Sort
View
ICALP
1998
Springer
15 years 9 months ago
Difficult Configurations - On the Complexity of LTrL
The complexity of LTrL, a global linear time temporal logic over traces is investigated. The logic is global because the truth of a formula is evaluated in a global state, also ca...
Igor Walukiewicz
145
Voted
ECOOP
1993
Springer
15 years 9 months ago
Frameworks in the Financial Engineering Domain - An Experience Report
: To supply the financial engineering community with adequate and timely software support we advocate a reusability oriented approach to software development. The approach focuses ...
Andreas Birrer, Thomas Eggenschwiler
APLAS
2008
ACM
15 years 7 months ago
Game Characterizations of Process Equivalences
In this paper we propose a hierarchy of games that allows us to make a systematic comparison of process equivalences by characterizing process equivalences as games. The well-known...
Xin Chen, Yuxin Deng
KDD
2006
ACM
228views Data Mining» more  KDD 2006»
16 years 5 months ago
Algorithms for time series knowledge mining
Temporal patterns composed of symbolic intervals are commonly formulated with Allen's interval relations originating in temporal reasoning. This representation has severe dis...
Fabian Mörchen
RTAS
2006
IEEE
15 years 11 months ago
Network-Code Machine: Programmable Real-Time Communication Schedules
Distributed hard real-time systems require guaranteed communication. One common approach is to restrict network access by enforcing a time-division multiple access (TDMA) schedule...
Sebastian Fischmeister, Oleg Sokolsky, Insup Lee