Sciweavers

160 search results - page 29 / 32
» Homomorphism preservation theorems
Sort
View
FUIN
2006
85views more  FUIN 2006»
13 years 7 months ago
Towards Integrated Verification of Timed Transition Models
Abstract. This paper describes an attempt to combine theorem proving and model-checking to formally verify real-time systems in a discrete time setting. The Timed Automata Modeling...
Mark Lawford, Vera Pantelic, Hong Zhang
JCT
2006
77views more  JCT 2006»
13 years 7 months ago
There are uncountably many topological types of locally finite trees
Consider two locally finite rooted trees as equivalent if each of them is a topological minor of the other, with an embedding preserving the tree-order. Answering a question of va...
Lilian Matthiesen
JUCS
2008
158views more  JUCS 2008»
13 years 7 months ago
Algebraic Laws for Feature Models
: Software Product Lines (SPL) may be adopted by either bootstrapping existing software products into a SPL, or extending an existing SPL to encompass an additional software produc...
Rohit Gheyi, Tiago Massoni, Paulo Borba
PE
2008
Springer
108views Optimization» more  PE 2008»
13 years 7 months ago
Rate-optimal schemes for Peer-to-Peer live streaming
In this paper we consider the problem of sending data in real time from information sources to sets of receivers, using peer-to-peer communications. We consider several models of ...
Laurent Massoulié, Andrew Twigg
COMBINATORICS
2004
129views more  COMBINATORICS 2004»
13 years 7 months ago
Operations on Well-Covered Graphs and the Roller-Coaster Conjecture
A graph G is well-covered if every maximal independent set has the same cardinality. Let sk denote the number of independent sets of cardinality k, and define the independence pol...
Philip Matchett