Sciweavers

558 search results - page 63 / 112
» Optimizing Symbolic Model Checking for Constraint-Rich Model...
Sort
View
ATVA
2005
Springer
131views Hardware» more  ATVA 2005»
14 years 2 months ago
An MTBDD-Based Implementation of Forward Reachability for Probabilistic Timed Automata
Multi-Terminal Binary Decision Diagrams (MTBDDs) have been successfully applied in symbolic model checking of probabilistic systems. In this paper we propose an encoding method for...
Fuzhi Wang, Marta Z. Kwiatkowska
ETFA
2006
IEEE
14 years 3 months ago
Optimizing Quality of Control in Networked Automation Systems using Probabilistic Models
New technological trends lead to the increasing use of network technologies in automation. Especially the Ethernet with TCP/IP and wireless networks find growing acceptance. The r...
Jürgen Greifeneder, Georg Frey
CAV
2008
Springer
108views Hardware» more  CAV 2008»
13 years 11 months ago
Reducing Concurrent Analysis Under a Context Bound to Sequential Analysis
This paper addresses the analysis of concurrent programs with shared memory. Such an analysis is undecidable in the presence of multiple procedures. One approach used in recent wor...
Akash Lal, Thomas W. Reps
TWC
2010
13 years 3 months ago
A fixed-lag particle smoother for blind SISO equalization of time-varying channels
We introduce a new sequential importance sampling (SIS) algorithm which propagates in time a Monte Carlo approximation of the posterior fixed-lag smoothing distribution of the symb...
Alberto Gaspar Guimarães, Boujemaa Ait-El-F...
LICS
2009
IEEE
14 years 3 months ago
On the Computational Complexity of Verifying One-Counter Processes
—One-counter processes are pushdown systems over a singleton stack alphabet (plus a stack-bottom symbol). We study the complexity of two closely related verification problems ov...
Stefan Göller, Richard Mayr, Anthony Widjaja ...