Sciweavers

231 search results - page 21 / 47
» Symbolic Model Checking for Event-Driven Real-Time Systems
Sort
View
ICTAI
2005
IEEE
14 years 2 months ago
Reachability Analysis for Uncertain SSPs
Stochastic Shortest Path problems (SSPs) can be efficiently dealt with by the Real-Time Dynamic Programming algorithm (RTDP). Yet, RTDP requires that a goal state is always reach...
Olivier Buffet
FM
2001
Springer
142views Formal Methods» more  FM 2001»
14 years 1 months ago
Model-Checking over Multi-valued Logics
Classical logic cannot be used to effectively reason about systems with uncertainty (lack of essential information) or inconsistency (contradictory information often occurring when...
Marsha Chechik, Steve M. Easterbrook, Victor Petro...
APSEC
2005
IEEE
14 years 2 months ago
Describing and Verifying Integrated Services of Home Network Systems
This paper presents a framework to specify and verify integrated services of a home network system (HNS). We first develop a modeling language to describe the HNS and the integra...
Pattara Leelaprute, Tatsuhiro Tsuchiya, Tohru Kiku...
SOFSEM
2009
Springer
14 years 5 months ago
Symbolic Reachability Analysis of Integer Timed Petri Nets
Petri nets are an effective formalism to model discrete event systems, and several variants have been defined to explicitly include real time in the model. We consider two fundam...
Min Wan, Gianfranco Ciardo
APSEC
2002
IEEE
14 years 1 months ago
Symbolic Simulation of Hybrid Systems
Continuous action systems (CAS) is a formalism intended for modeling hybrid systems (systems that combine discrete control with continuous behavior), and proving properties about ...
Ralph-Johan Back, Cristina Cerschi Seceleanu, Jan ...