1705 search results - page 34 / 341 » Representing Constraints with Automata |
ATVA
2006
Springer
13 years 11 months ago
2006
Springer
In this paper we give a symbolic concurrent semantics for network of timed automata (NTA) in terms of extended symbolic nets. Extended symbolic nets are standard occurrence nets ex...
ENTCS
2008
13 years 7 months ago
2008
Given a timed automaton with parametric timings, our objective is to describe a procedure for deriving constraints on the parametric timings in order to ensure that, for each valu...
TACAS
2009
Springer
14 years 6 days ago
2009
Springer
Abstract. We present a method which computes optimized representations for non-convex polyhedra. Our method detects so-called redundant linear constraints in these representations ...
LICS
2002
IEEE
14 years 18 days ago
2002
IEEE
We study relations on trees defined by first-order constraints over a vocabulary that includes the tree extension relation Ì Ì ¼, holding if and only if every branch of Ì ex...
SSD
2001
Springer
14 years 3 days ago
2001
Springer
The notion of time granularity comes into play in a variety of problems involving time representation and management in database applications, including temporal database design, t...