Sciweavers

30 search results - page 4 / 6
» Graded-CTL: Satisfiability and Symbolic Model Checking
Sort
View
CDC
2009
IEEE
147views Control Systems» more  CDC 2009»
13 years 3 months ago
A probabilistic approach for control of a stochastic system from LTL specifications
We consider the problem of controlling a continuous-time linear stochastic system from a specification given as a Linear Temporal Logic (LTL) formula over a set of linear predicate...
Morteza Lahijanian, Sean B. Andersson, Calin Belta
ICFEM
2009
Springer
13 years 10 months ago
An Empirical Study of Structural Constraint Solving Techniques
Structural constraint solving allows finding object graphs that satisfy given constraints, thereby enabling software reliability tasks, such as systematic testing and error recove...
Junaid Haroon Siddiqui, Sarfraz Khurshid
TSMC
2010
13 years 20 days ago
Active Learning of Plans for Safety and Reachability Goals With Partial Observability
Traditional planning assumes reachability goals and/or full observability. In this paper, we propose a novel solution for safety and reachability planning with partial observabilit...
Wonhong Nam, Rajeev Alur
ENTCS
2006
173views more  ENTCS 2006»
13 years 6 months ago
Concurrent LSC Verification: On Decomposition Properties of Partially Ordered Symbolic Automata
Partially Ordered Symbolic Automata (POSAs) are used as the semantical foundation of visual formalisms like the scenario based language of Live Sequence Charts (LSCs). To check whe...
Tobe Toben, Bernd Westphal
CORR
2010
Springer
208views Education» more  CORR 2010»
13 years 6 months ago
Bounded Model Checking of Multi-threaded Software using SMT solvers
The transition from single-core to multi-core processors has made multi-threaded software an important subject in computer aided verification. Here, we describe and evaluate an ex...
Lucas Cordeiro, Bernd Fischer 0002