Sciweavers

662 search results - page 90 / 133
» Model Checking Procedures for Infinite State Systems
Sort
View
CONCUR
2010
Springer
15 years 28 days ago
Kleene, Rabin, and Scott Are Available
We are concerned with the availability of systems, defined as the ratio between time of correct functioning and uptime. We propose to model guaranteed availability in terms of regu...
Jochen Hoenicke, Roland Meyer, Ernst-Rüdiger ...
RE
2010
Springer
14 years 6 months ago
A UML-based static verification framework for security
Secure software engineering is a new research area that has been proposed to address security issues during the development of software systems. This new area of research advocates...
Igor Siveroni, Andrea Zisman, George Spanoudakis
CONCUR
2001
Springer
15 years 4 months ago
Symbolic Computation of Maximal Probabilistic Reachability
We study the maximal reachability probability problem for infinite-state systems featuring both nondeterministic and probabilistic choice. The problem involves the computation of ...
Marta Z. Kwiatkowska, Gethin Norman, Jeremy Sprost...
CMSB
2010
Springer
14 years 6 months ago
Action-based analysis of discrete regulatory networks with short-term stimuli
To incorporate instant effects and different timescales within a single biological system, an extension of discrete regulatory networks with short-term stimuli is proposed. By mai...
Christian Krause, Carola Krause, Erik P. de Vink
AUTOMATICA
2008
51views more  AUTOMATICA 2008»
14 years 12 months ago
New method for identifying finite degree Volterra series
In this paper, the identification of a class of nonlinear systems which admits input-output maps described by a finite degree Volterra series is considered. In actual fact, it app...
Wael Suleiman, André Monin