Sciweavers

448 search results - page 37 / 90
» The Complexity of Codiagnosability for Discrete Event and Ti...
Sort
View
HYBRID
2007
Springer
14 years 1 months ago
Symbolic Analysis for GSMP Models with One Stateful Clock
We consider the problem of verifying reachability properties of stochastic real-time systems modeled as generalized semi-Markov processes (GSMPs). The standard simulation-based tec...
Mikhail Bernadsky, Rajeev Alur
ATVA
2007
Springer
115views Hardware» more  ATVA 2007»
14 years 1 months ago
A Compositional Semantics for Dynamic Fault Trees in Terms of Interactive Markov Chains
Abstract. Dynamic fault trees (DFTs) are a versatile and common formalism to model and analyze the reliability of computer-based systems. This paper presents a formal semantics of ...
Hichem Boudali, Pepijn Crouzen, Mariëlle Stoe...
SLP
1994
77views more  SLP 1994»
13 years 9 months ago
Modal Event Calculus
We consider a hierarchy of modal event calculi to represent and reason about partially ordered events. These calculi are based on the model of time and change of Kowalski and Sergo...
Iliano Cervesato, Luca Chittaro, Angelo Montanari
CCS
2007
ACM
14 years 1 months ago
An algorithm for the appraisal of assurance indicators for complex business processes
In order to provide certified security services we must provide indicators that can measure the level of assurance that a complex business process can offer. Unfortunately the fo...
Fabio Massacci, Artsiom Yautsiukhin
CHARME
1993
Springer
68views Hardware» more  CHARME 1993»
13 years 11 months ago
Temporal Analysis of Time Bounded Digital Systems
To perform veri cation of digital systems with time bounded delays, it is essential to characterize the space of all possible system behaviors. In this paper, we describe our analy...
Alan R. Martello, Steven P. Levitan