Sciweavers

259 search results - page 16 / 52
» Bounded Model Checking for Timed Automata
Sort
View
FMCAD
2004
Springer
15 years 2 months ago
Increasing the Robustness of Bounded Model Checking by Computing Lower Bounds on the Reachable States
Most symbolic model checkers are based on either Binary Decision Diagrams (BDDs), which may grow exponentially large, or Satisfiability (SAT) solvers, whose time requirements rapi...
Mohammad Awedh, Fabio Somenzi
CAV
2003
Springer
140views Hardware» more  CAV 2003»
15 years 1 months ago
Rabbit: A Tool for BDD-Based Verification of Real-Time Systems
Thispapergivesashort overviewofa model checking tool forreal-time systems. The modeling language are timed automata extended with concepts for modular modeling. The tool provides r...
Dirk Beyer, Claus Lewerentz, Andreas Noack
FORMATS
2009
Springer
15 years 4 months ago
On the Supports of Recognizable Timed Series
Recently, the model of weighted timed automata has gained interest within the real-time community. In a previous work, we built a bridge to the theory of weighted automata and intr...
Karin Quaas
FSEN
2007
Springer
15 years 3 months ago
Zone-Based Universality Analysis for Single-Clock Timed Automata
Abstract. During the last years, timed automata have become a popular model for describing the behaviour of real-time systems. In particular, there has been much research on proble...
Parosh Aziz Abdulla, Joël Ouaknine, Karin Qua...
FMOODS
2006
14 years 11 months ago
Modeling Long-Running Transactions with Communicating Hierarchical Timed Automata
Long-Running transactions consist of tasks which may be executed sequentially and in parallel, may contain sub-tasks, and may require to be completed before a deadline. These trans...
Ruggero Lanotte, Andrea Maggiolo-Schettini, Paolo ...