113 search results - page 20 / 23 » Timed Automata: Semantics, Algorithms and Tools |
LCTRTS
2004
Springer
14 years 22 days ago
2004
Springer
We present a polynomial upper bound for flattening of UML statecharts. An efficient flattening technique is derived and implemented in SCOPE—a code generator targeting constra...
ACRI
2004
Springer
14 years 23 days ago
2004
Springer
We have investigated a problem where the goal is to find automatically the best rule for a cell in the cellular automata model. The cells are either of type OBSTACLE, EMPTY or CRE...
SIGMOD
2012
ACM
11 years 9 months ago
2012
ACM
End-users increasingly find the need to perform light-weight, customized schema mapping. State-of-the-art tools provide powerful functions to generate schema mappings, but they u...
CICLING
2003
Springer
14 years 18 days ago
2003
Springer
NLPsystem developers and corpus lexicographers would both bene t from a tool for nding and organizing the distinctive patterns of use of words in texts. Such a tool would be an ass...
POPL
2008
ACM
14 years 7 months ago
2008
ACM
This paper presents a demand-driven, flow-insensitive analysis algorithm for answering may-alias queries. We formulate the computation of alias queries as a CFL-reachability probl...