6306 search results - page 308 / 1262 » Space, Time, and the Use of Language |
203
click to vote
ESOP
2009
Springer
15 years 11 months ago
2009
Springer
The context-free language (CFL) reachability problem is well known and studied in computer science, as a fundamental problem underlying many important static analyses such as point...
190
Voted
FSTTCS
2007
Springer
16 years 1 months ago
2007
Springer
Abstract. We provide a framework for distributed systems that impose timing constraints on their executions. We propose a timed model of communicating finite-state machines, which...
202
click to vote
LICS
2003
IEEE
16 years 21 days ago
2003
IEEE
We consider several questions related to the use of digitization techniques for timed automata. These very successful techniques reduce dense-time language inclusion problems to d...
210
Voted
ATAL
2010
Springer
15 years 7 months ago
2010
Springer
We extend the framework of mixed multi-unit combinatorial auctions to include time constraints, present an expressive bidding language, and show how to solve the winner determinati...
165
Voted
FORMATS
2007
Springer
16 years 1 months ago
2007
Springer
We identify a class of timed automata, which we call counter-free input-determined automata, which characterize the class of timed languages definable by several timed temporal l...