Sciweavers

1024 search results - page 16 / 205
» Compositional Methods for Probabilistic Systems
Sort
View
ENTCS
2010
130views more  ENTCS 2010»
13 years 9 months ago
Compositional System Security with Interface-Confined Adversaries
This paper presents a formal framework for compositional reasoning about secure systems. A key insight is to view a trusted system in terms of the interfaces that the various comp...
Deepak Garg, Jason Franklin, Dilsun Kirli Kaynar, ...
FM
2003
Springer
92views Formal Methods» more  FM 2003»
14 years 2 months ago
Composing Invariants
We explore the question of the composition of invariance specifications in a context of concurrent and reactive systems. Depending on how compositionality is stated and how invar...
Michel Charpentier
ICMCS
2006
IEEE
155views Multimedia» more  ICMCS 2006»
14 years 3 months ago
Fully and Semi-Automatic Music Sports Video Composition
Video composition is important for music video production. In this paper we propose an automatic method to assist the music sports video composition operation. Our approach is bas...
Jinjun Wang, Engsiong Chng, Changsheng Xu
SCL
2008
76views more  SCL 2008»
13 years 9 months ago
Probabilistic output admissible set for systems with time-varying uncertainties
This paper considers time-varying uncertain constrained systems, and develops a method for computing a probabilistic output admissible (POA) set. This set consists of the initial ...
Takeshi Hatanaka, Kiyotsugu Takaba
STOC
2007
ACM
132views Algorithms» more  STOC 2007»
14 years 10 months ago
On the convergence of Newton's method for monotone systems of polynomial equations
Monotone systems of polynomial equations (MSPEs) are systems of fixed-point equations X1 = f1(X1, . . . , Xn), . . . , Xn = fn(X1, . . . , Xn) where each fi is a polynomial with p...
Stefan Kiefer, Michael Luttenberger, Javier Esparz...