Sciweavers

72 search results - page 12 / 15
» Model Checking Synchronous Timing Diagrams
Sort
View
WEA
2005
Springer
119views Algorithms» more  WEA 2005»
14 years 29 days ago
On Symbolic Scheduling Independent Tasks with Restricted Execution Times
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...
Daniel Sawitzki
RTAS
2009
IEEE
14 years 2 months ago
Execution Strategies for PTIDES, a Programming Model for Distributed Embedded Systems
—We define a family of execution policies for a programming model called PTIDES (Programming Temporally Integrated Distributed Embedded Systems). A PTIDES application (factory a...
Jia Zou, Slobodan Matic, Edward A. Lee, Thomas Hui...
MICRO
2010
IEEE
156views Hardware» more  MICRO 2010»
13 years 5 months ago
Explicit Communication and Synchronization in SARC
SARC merges cache controller and network interface functions by relying on a single hardware primitive: each access checks the tag and the state of the addressed line for possible...
Manolis Katevenis, Vassilis Papaefstathiou, Stamat...
CHARME
2003
Springer
73views Hardware» more  CHARME 2003»
13 years 11 months ago
Towards Diagrammability and Efficiency in Event Sequence Languages
Industrial verification teams are actively developing suitable event sequence languages for hardware verification. Such languages must be expressive, designer friendly, and hardwar...
Kathi Fisler
APN
2004
Springer
14 years 27 days ago
Reachability Set Generation for Petri Nets: Can Brute Force Be Smart?
Generating the reachability set is one of the most commonly required step when analyzing the logical or stochastic behavior of a system modeled with Petri nets. Traditional “expl...
Gianfranco Ciardo