Sciweavers

TOPNOC
2008
13 years 2 months ago
Directed Unfolding of Petri Nets
The key to efficient on-the-fly reachability analysis based on unfolding is to focus the expansion of the finite prefix towards the desired marking. However, current unfolding stra...
Blai Bonet, Patrik Haslum, Sarah L. Hickmott, Sylv...
MAM
2006
124views more  MAM 2006»
13 years 2 months ago
Design optimization and space minimization considering timing and code size via retiming and unfolding
The increasingly complicated DSP processors and applications with strict timing and code size constraints require design automation tools to consider multiple optimizations such a...
Qingfeng Zhuge, Chun Xue, Zili Shao, Meilin Liu, M...
CORR
2006
Springer
94views Education» more  CORR 2006»
13 years 2 months ago
Epsilon-Unfolding Orthogonal Polyhedra
Abstract. An unfolding of a polyhedron is produced by cutting the surface and flattening to a single, connected, planar piece without overlap (except possibly at boundary points). ...
Mirela Damian, Robin Y. Flatland, Joseph O'Rourke
DCG
2008
93views more  DCG 2008»
13 years 2 months ago
Metric Combinatorics of Convex Polyhedra: Cut Loci and Nonoverlapping Unfoldings
Let S be the boundary of a convex polytope of dimension d + 1, or more generally let S be a convex polyhedral pseudomanifold. We prove that S has a polyhedral nonoverlapping unfold...
Ezra Miller, Igor Pak
DCG
2010
75views more  DCG 2010»
13 years 2 months ago
Star Unfolding Convex Polyhedra via Quasigeodesic Loops
We extend the notion of star unfolding to be based on a quasigeodesic loop Q rather than on a point. This gives a new general method to unfold the surface of any convex polyhedron ...
Jin-ichi Itoh, Joseph O'Rourke, Costin Vîlcu
BMCBI
2007
104views more  BMCBI 2007»
13 years 2 months ago
Joint mapping of genes and conditions via multidimensional unfolding analysis
Background: Microarray compendia profile the expression of genes in a number of experimental conditions. Such data compendia are useful not only to group genes and conditions base...
Katrijn Van Deun, Kathleen Marchal, Willem J. Heis...
APN
2008
Springer
13 years 4 months ago
Faster Unfolding of General Petri Nets Based on Token Flows
In this paper we propose two new unfolding semantics for general Petri nets combining the concept of prime event structures with the idea of token flows developed in [11]. In contr...
Robin Bergenthum, Robert Lorenz, Sebastian Mauser
ACSD
2008
IEEE
108views Hardware» more  ACSD 2008»
13 years 4 months ago
Modular construction of finite and complete prefixes of Petri net unfoldings
This paper considers distributed systems, defined as a collection of components interacting through interfaces. Components, interfaces and distributed systems are modeled as Petri...
Agnes Madalinski, Eric Fabre
ESOP
1998
Springer
13 years 6 months ago
A Polyvariant Binding-Time Analysis for Off-line Partial Deduction
Abstract. We study the notion of binding-time analysis for logic programs. We formalise the unfolding aspect of an on-line partial deduction s a Prolog program. Using abstract inte...
Maurice Bruynooghe, Michael Leuschel, Konstantinos...
JCDCG
2004
Springer
13 years 8 months ago
Grid Vertex-Unfolding Orthostacks
An algorithm was presented in [1] for unfolding orthostacks into one piece without overlap by using arbitrary cuts along the surface. It was conjectured that orthostacks could be ...
Erik D. Demaine, John Iacono, Stefan Langerman