Sciweavers

180 search results - page 13 / 36
» Self-Assembly of Infinite Structures
Sort
View
SIGSOFT
2005
ACM
14 years 10 months ago
Relational analysis of algebraic datatypes
We present a technique that enables the use of finite model finding to check the satisfiability of certain formulas whose intended models are infinite. Such formulas arise when us...
Viktor Kuncak, Daniel Jackson
ENTCS
2002
80views more  ENTCS 2002»
13 years 9 months ago
Monotonic Extensions of Petri Nets: Forward and Backward Search Revisited
In this paper, we revisit the forward and backward approaches to the verification of extensions of infinite state Petri Nets. As contributions, we propose an efficient data struct...
Alain Finkel, Jean-François Raskin, Mathias...
JSYML
2008
112views more  JSYML 2008»
13 years 9 months ago
On the structure of the Medvedev lattice
We investigate the structure of the Medvedev lattice as a partial order. We prove that every interval in the lattice is either finite, in which case it is isomorphic to a finite B...
Sebastiaan Terwijn
JMIV
2008
69views more  JMIV 2008»
13 years 9 months ago
Transport of Relational Structures in Groups of Diffeomorphisms
This paper focuses on the issue of translating the relative variation of one shape with respect to another in a template centered representation. The context is the theory of Diffe...
Laurent Younes, Anqi Qiu, Raimond L. Winslow, Mich...
COMBINATORICS
2004
243views more  COMBINATORICS 2004»
13 years 9 months ago
Class-Uniformly Resolvable Group Divisible Structures II: Frames
We consider Class-Uniformly Resolvable frames (CURFs), which are group divisible designs with partial resolution classes subject to the class-uniform condition. We derive the nece...
Peter Danziger, Brett Stevens