Sciweavers

3825 search results - page 69 / 765
» The Language of Time: A Reader
Sort
View
CSR
2007
Springer
15 years 12 months ago
Ruling Out Polynomial-Time Approximation Schemes for Hard Constraint Satisfaction Problems
The maximum constraint satisfaction problem (Max CSP) is the following computational problem: an instance is a finite collection of constraints on a set of variables, and the goal...
Peter Jonsson, Andrei A. Krokhin, Fredrik Kuivinen
ISORC
1998
IEEE
15 years 10 months ago
Specification of Real-Time Interaction Constraints
We present a coordination language and its semantics for specification and implementation of object-oriented realtime systems. Real-time systems operate under real-time constraint...
Brian Nielsen, Shangping Ren, Gul Agha
RTAS
1997
IEEE
15 years 9 months ago
Efficient Run-Time Monitoring of Timing Constraints
A real-time system operates under timing constraints which it may be unable to meet under some circumstances. The criticality of a timing constraint determines how a system is to ...
Aloysius K. Mok, Guangtian Liu
GI
2009
Springer
15 years 9 months ago
Strategic Interaction Definition Language
: Managing general game playing is the problem addressed in this paper. It is considered to be done on a game description written in a declarative language. The language, which is ...
Rustam Tagiew
ACSD
2006
IEEE
129views Hardware» more  ACSD 2006»
15 years 12 months ago
Extended Timed Automata and Time Petri Nets
Timed Automata (TA) and Time Petri Nets (TPN) are two well-established formal models for real-time systems. Recently, a linear transformation of TA to TPNs preserving reachability...
Patricia Bouyer, Pierre-Alain Reynier, Serge Hadda...