Sciweavers

Share
ICFEM
2009
Springer
9 years 3 months ago
Graded-CTL: Satisfiability and Symbolic Model Checking
In this paper we continue the study of a strict extension of the Computation Tree Logic, called graded-CTL, recently introduced by the same authors. This new logic augments the sta...
Alessandro Ferrante, Margherita Napoli, Mimmo Pare...
CAV
2010
Springer
282views Hardware» more  CAV 2010»
9 years 9 months ago
A NuSMV Extension for Graded-CTL Model Checking
Graded-CTL is an extension of CTL with graded quanti´Čüers which allow to reason about either at least or all but any number of possible futures. In this paper we show an extension...
Alessandro Ferrante, Maurizio Memoli, Margherita N...
WEA
2004
Springer
124views Algorithms» more  WEA 2004»
9 years 11 months ago
Experimental Studies of Symbolic Shortest-Path Algorithms
Abstract. Graphs can be represented symbolically by the Ordered Binary Decision Diagram (OBDD) of their characteristic function. To solve problems in such implicitly given graphs, ...
Daniel Sawitzki
books