1650 search results - page 88 / 330 » The HOM problem is decidable |
122
click to vote
HYBRID
1997
Springer
15 years 8 months ago
1997
Springer
We de ne robust timed automata, which are timed automata that accept all trajectories \robustly": if a robust timed automaton accepts a trajectory, then it must accept neighbo...
110
click to vote
BIRTHDAY
2006
Springer
15 years 7 months ago
2006
Springer
We consider secrecy problems for cryptographic protocols modeled using Horn clauses and present general classes of Horn clauses which can be efficiently decided. Besides simplifyin...
123
click to vote
FOSSACS
2006
Springer
15 years 7 months ago
2006
Springer
We extend the propositional dynamic logic PDL of Fischer and Ladner with a restricted kind of recursive programs using the formalism of visibly pushdown automata (Alur, Madhusudan...
120
click to vote
FOSSACS
2006
Springer
15 years 7 months ago
2006
Springer
Metric Temporal Logic (MTL) is a real-time extension of Linear Temporal Logic that was proposed fifteen years ago and has since been extensively studied. Since the early 1990s, it ...
170
Voted
DALT
2009
Springer
15 years 7 months ago
2009
Springer
We propose a framework to compute the utility of a proposal w.r.t. a preference set in a negotiation process. In particular, we refer to preferences expressed as weighted formulas ...