Sciweavers

575 search results - page 23 / 115
» Model Checking Restricted Sets of Timed Paths
Sort
View
CAV
2010
Springer
282views Hardware» more  CAV 2010»
15 years 3 months ago
A NuSMV Extension for Graded-CTL Model Checking
Graded-CTL is an extension of CTL with graded quantifiers 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...
CORR
2004
Springer
124views Education» more  CORR 2004»
14 years 11 months ago
On the existence of stable models of non-stratified logic programs
In this paper we analyze the relationship between cyclic definitions and consistency in GelfondLifschitz's answer sets semantics (initially defined as `stable model semantics...
Stefania Costantini
ICCAD
1994
IEEE
117views Hardware» more  ICCAD 1994»
15 years 3 months ago
Optimization of critical paths in circuits with level-sensitive latches
A simple extension of the critical path method is presented which allows more accurate optimization of circuits with level-sensitive latches. The extended formulation provides a s...
Timothy M. Burks, Karem A. Sakallah
ANOR
2006
174views more  ANOR 2006»
14 years 12 months ago
Evaluation of choice set generation algorithms for route choice models
This paper discusses choice set generation and route choice model estimation for large-scale urban networks. Evaluating the effectiveness of Advanced Traveler Information Systems (...
Shlomo Bekhor, Moshe E. Ben-Akiva, M. Scott Rammin...
IPPS
2003
IEEE
15 years 5 months ago
Task Graph Scheduling Using Timed Automata
In this paper we develop a methodology for treating the problem of scheduling partially-ordered tasks on parallel machines. Our framework is based on the timed automaton model, or...
Yasmina Abdeddaïm, Abdelkarim Kerbaa, Oded Ma...