Sciweavers

5180 search results - page 52 / 1036
» Concurrency, Time, and Constraints
Sort
View
DAC
1996
ACM
15 years 4 months ago
Efficient Partial Enumeration for Timing Analysis of Asynchronous Systems
-- This paper presents an efficient method for the timing verification of concurrent systems, modeled as labeled Timed Petri nets. The verification problems we consider require us ...
Eric Verlind, Gjalt G. de Jong, Bill Lin
APN
2006
Springer
15 years 3 months ago
Complete Finite Prefixes of Symbolic Unfoldings of Safe Time Petri Nets
Abstract. Time Petri nets have proved their interest in modeling realtime concurrent systems. Their usual semantics is defined in term of firing sequences, which can be coded in a ...
Thomas Chatain, Claude Jard
FPL
2004
Springer
90views Hardware» more  FPL 2004»
15 years 5 months ago
Run-Time-Conscious Automatic Timing-Driven FPGA Layout Synthesis
Abstract. Layout tools for FPGAs can typically be run in two different modes: non-timing-driven and timing-driven. Non-timing-driven mode produces a solution quickly, without consi...
Jason Helge Anderson, Sudip Nag, Kamal Chaudhary, ...
VLDB
1997
ACM
99views Database» more  VLDB 1997»
15 years 4 months ago
Resource Scheduling in Enhanced Pay-Per-View Continuous Media Databases
The enhanced pay-per-view (EPPV) model for providing continuous-media-on-demand(CMOD) services associates with each continuous media clip a display frequency that dependson the cl...
Minos N. Garofalakis, Banu Özden, Abraham Sil...
TVLSI
2002
102views more  TVLSI 2002»
14 years 11 months ago
Algorithm level re-computing using implementation diversity: a register transfer level concurrent error detection technique
Concurrent error detection (CED) based on time redundancy entails performing the normal computation and the re-computation at different times and then comparing their results. Time...
Ramesh Karri, Kaijie Wu