Sciweavers

305 search results - page 29 / 61
» Decidability of Split Equivalence
Sort
View
APPML
2005
55views more  APPML 2005»
14 years 9 months ago
Recovering a phylogenetic tree using pairwise closure operations
A fundamental task in evolutionary biology is the amalgamation of a collection P of leaf-labelled trees into a single parent tree. A desirable feature of any such amalgamation is ...
Katharina T. Huber, Vincent Moulton, Charles Sempl...
STACS
2007
Springer
15 years 3 months ago
Associative-Commutative Deducibility Constraints
We consider deducibility constraints, which are equivalent to particular Diophantine systems, arising in the automatic verification of security protocols, in presence of associati...
Sergiu Bursuc, Hubert Comon-Lundh, Stéphani...
SIAMDM
2008
100views more  SIAMDM 2008»
14 years 9 months ago
Tree-Related Widths of Graphs and Hypergraphs
A hypergraph pair is a pair (G, H) where G and H are hypergraphs on the same set of vertices. We extend the definitions of hypertree-width [7] and generalised hypertree-width [8] ...
Isolde Adler
ICALP
2000
Springer
15 years 1 months ago
Reasoning about Idealized ALGOL Using Regular Languages
We explain how recent developments in game semantics can be applied to reasoning about equivalence of terms in a non-trivial fragment of Idealized Algol (IA) by expressing sets of ...
Dan R. Ghica, Guy McCusker
IANDC
2008
87views more  IANDC 2008»
14 years 9 months ago
Timed Petri nets and timed automata: On the discriminating power of zeno sequences
Timed Petri nets and timed automata are two standard models for the analysis of real-time systems. In this paper, we prove that they are incomparable for the timed language equival...
Patricia Bouyer, Serge Haddad, Pierre-Alain Reynie...