Sciweavers

1019 search results - page 190 / 204
» Petri Net Transformations in the
Sort
View
RE
2002
Springer
13 years 7 months ago
A Software Fault Tree Approach to Requirements Analysis of an Intrusion Detection System
Requirements analysis for an Intrusion Detection System (IDS) involves deriving requirements for the IDS from analysis of the intrusion domain. When the IDS is, as here, a collecti...
Guy G. Helmer, Johnny S. Wong, Mark Slagell, Vasan...
TCAD
1998
95views more  TCAD 1998»
13 years 7 months ago
A framework for comparing models of computation
—We give a denotational framework (a “meta model”) within which certain properties of models of computation can be compared. It describes concurrent processes in general term...
Edward A. Lee, Alberto L. Sangiovanni-Vincentelli
TCS
2002
13 years 7 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 7 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 6 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