Sciweavers

866 search results - page 28 / 174
» A Formal Investigation of
Sort
View
IFL
2000
Springer
14 years 1 months ago
Improving Cache Effectiveness through Array Data Layout Manipulation in SAC
Sac is a functional array processing language particularly designed with numerical applications in mind. In this field the runtime performance of programs critically depends on the...
Clemens Grelck
FSTTCS
2001
Springer
14 years 2 months ago
Properties of Distributed Timed-Arc Petri Nets
Abstract. In [12] we started a research on a distributed-timed extension of Petri nets where time parameters are associated with tokens and arcs carry constraints that qualify the ...
Mogens Nielsen, Vladimiro Sassone, Jirí Srb...
SYNASC
2005
IEEE
77views Algorithms» more  SYNASC 2005»
14 years 3 months ago
On P Systems with Bounded Parallelism
— A framework that describes the evolution of P systems with bounded parallelism is defined by introducing basic formal features that can be then integrated into a structural op...
Francesco Bernardini, Francisco José Romero...
ENTCS
2006
117views more  ENTCS 2006»
13 years 9 months ago
Distributed Graph Traversals by Relabelling Systems with Applications
Graph traversals are in the basis of many distributed algorithms. In this paper, we use graph relabelling systems to encode two basic graph traversals which are the broadcast and ...
Bilel Derbel, Mohamed Mosbah
FORMATS
2009
Springer
14 years 4 months ago
Critical Paths in the Partial Order Unfolding of a Stochastic Petri Net
In concurrent real-time processes, the speed of individual components has a double impact: on the one hand, the overall latency of a compound process is affected by the latency of...
Anne Bouillard, Stefan Haar, Sidney Rosario