4850 search results - page 607 / 970 » Proof and Computation in Geometry |
208
click to vote
CALCO
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. Coalgebra automata, introduced by the second author, generalize the well-known automata that operate on infinite words/streams, trees, graphs or transition systems. This...
165
click to vote
FM
2009
Springer
16 years 1 months ago
2009
Springer
e Abstractions for Parameterized Systems JOXAN JAFFAR and ANDREW E. SANTOSA Department of Computer Science, National University of Singapore Singapore 117590 {joxan,andrews}comp.nu...
177
click to vote
FSTTCS
2009
Springer
16 years 1 months ago
2009
Springer
We investigate the parameterized complexity of generalisations and variations of the dominating set problem on classes of graphs that are nowhere dense. In particular, we show that...
199
click to vote
LOPSTR
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. We present a method based on logic program transformation, for verifying Computation Tree Logic (CTL∗ ) properties of finite state reactive systems. The finite state ...
162
click to vote
LPNMR
2009
Springer
16 years 1 months ago
2009
Springer
Problems arising from the revision of propositional knowledge bases have been intensively studied for two decades. Many different approaches to revision have thus been suggested, w...