25 search results - page 4 / 5 » Unbounded, Fully Symbolic Model Checking of Timed Automata u... |
ATVA
2005
Springer
13 years 11 months ago
2005
Springer
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...
ISLPED
2010
ACM
13 years 6 months ago
2010
ACM
The ongoing scaling of semiconductor technology is causing severe increase of on-chip power density and temperature in microprocessors. This has raised urgent requirement for both...
WEA
2005
Springer
13 years 11 months ago
2005
Springer
Ordered Binary Decision Diagrams (OBDDs) are a data structure for Boolean functions which supports many useful operations. It finds applications in CAD, model checking, and symbol...
FORMATS
2006
Springer
13 years 9 months ago
2006
Springer
Recently, a new approach to the symbolic model checking of timed automata based on a partial order semantics was introduced, which relies on event zones that use vectors of event o...
FORMATS
2004
Springer
13 years 11 months ago
2004
Springer
We propose an effective and complete method for verifying safety and properties of timed systems, which is based on predicate abstraction for g finite abstractions of timed autom...