Sciweavers

1099 search results - page 207 / 220
» Petri net ontology
Sort
View
TCS
2002
13 years 10 months ago
Asymptotic behavior in a heap model with two pieces
In a heap model, solid blocks, or pieces, pile up according to the Tetris game mechanism. An optimal schedule is an in nite sequence of pieces minimizing the asymptotic growth rat...
Jean Mairesse, Laurent Vuillon
PE
2007
Springer
130views Optimization» more  PE 2007»
13 years 10 months ago
Performability analysis of clustered systems with rejuvenation under varying workload
This paper develops time-based rejuvenation policies to improve the performability measures of a cluster system. Three rejuvenation policies, namely standard rejuvenation, delayed...
Dazhi Wang, Wei Xie, Kishor S. Trivedi
RP
2010
Springer
146views Control Systems» more  RP 2010»
13 years 9 months ago
Depth Boundedness in Multiset Rewriting Systems with Name Binding
Abstract. In this paper we consider ν-MSR, a formalism that combines the two main existing approaches for multiset rewriting, namely MSR and CMRS. In ν-MSR we rewrite multisets o...
Fernando Rosa Velardo
SIGMETRICS
2010
ACM
215views Hardware» more  SIGMETRICS 2010»
13 years 9 months ago
Quantifying the sustainability impact of data center availability
Data center availability is critical considering the explosive growth in Internet services and people’s dependence on them. Furthermore, in recent years, sustainability has beco...
Manish Marwah, Paulo Romero Martins Maciel, Amip S...
WRLA
2010
13 years 9 months ago
Multiset Rewriting: A Semantic Framework for Concurrency with Name Binding
Abstract. We revise multiset rewriting with name binding, by combining the two main existing approaches to the study of concurrency by means of multiset rewriting, multiset rewriti...
Fernando Rosa Velardo