Sciweavers

3653 search results - page 87 / 731
» On Recognizable Timed Languages
Sort
View
133
Voted
STACS
2001
Springer
15 years 9 months ago
A Logical Approach to Decidability of Hierarchies of Regular Star-Free Languages
We propose a new, logical, approach to the decidability problem for the Straubing and Brzozowski hierarchies based on the preservation theorems from model theory, on a theorem of ...
Victor L. Selivanov
ZEUS
2010
200views Communications» more  ZEUS 2010»
15 years 6 months ago
On designing a people-oriented constraint-based workflow language
The control-flow of business workflows is characterized by the strict execution order of the activities that is already defined at design time. This well-structured control-flow is...
Frank Leymann, Tobias Unger, Sebastian Wagner
CLEF
2008
Springer
15 years 6 months ago
GeoCLEF 2008: The CLEF 2008 Cross-Language Geographic Information Retrieval Track Overview
GeoCLEF is an evaluation initiative for testing queries with a geographic specification in large set of text documents. GeoCLEF ran a regular track for the third time within the C...
Thomas Mandl, Paula Carvalho, Giorgio Maria Di Nun...
171
Voted
USENIX
2000
15 years 6 months ago
FiST: A Language for Stackable File Systems
Traditional file system development is difficult. Stackable file systems promise to ease the development of file systems by offering a mechanism for incremental development. Unfor...
Erez Zadok, Jason Nieh
ICALP
2009
Springer
16 years 5 months ago
Weak Alternating Timed Automata
Alternating timed automata on infinite words are considered. The main result is a characterization of acceptance conditions for which the emptiness problem for the automata is deci...
Pawel Parys, Igor Walukiewicz