203 search results - page 7 / 41 » Improved undecidability results on weighted timed automata |
ACSD
2007
IEEE
13 years 9 months ago
2007
IEEE
We present an improvement of the SAT-based Unbounded Model Checking (UMC) algorithm. UMC, a symbolic approach introduced in [7], uses propositional formulas in conjunctive normal ...
CONCUR
2006
Springer
13 years 11 months ago
2006
Springer
We propose a remedy to that part of the state-explosion problem for timed automata which is due to interleaving of actions. We prove the following quite surprising result: the unio...
ISAAC
2004
Springer
14 years 22 days ago
2004
Springer
We study complexity and approximation of min weighted node coloring in planar, bipartite and split graphs. We show that this problem is NP-complete in planar graphs, even if they a...
CSL
2002
Springer
13 years 7 months ago
2002
Springer
We survey the use of weighted finite-state transducers (WFSTs) in speech recognition. We show that WFSTs provide a common and natural representation for HMM models, context-depend...
ICCAD
2009
IEEE
13 years 5 months ago
2009
IEEE
We present a rigorous framework that defines a class of net weighting schemes in which unconstrained minimization is successively performed on a weighted objective. We show that, ...