Sciweavers

732 search results - page 90 / 147
» Axiomatising timed automata
Sort
View
CONCUR
2010
Springer
13 years 8 months ago
Dating Concurrent Objects: Real-Time Modeling and Schedulability Analysis
Abstract. In this paper we introduce a real-time extension of the concurrent object modeling language Creol which is based on duration statements indicating best and worst case exe...
Frank S. de Boer, Mohammad Mahdi Jaghoori, Einar B...
DAC
2003
ACM
14 years 8 months ago
Seed encoding with LFSRs and cellular automata
Reseeding is used to improve fault coverage of pseudorandom testing. The seed corresponds to the initial state of the PRPG before filling the scan chain. In this paper, we present...
Ahmad A. Al-Yamani, Edward J. McCluskey
CDC
2008
IEEE
156views Control Systems» more  CDC 2008»
14 years 2 months ago
Diagnosability of hybrid automata with measurement uncertainty
— We propose a diagnosability notion that depends on two parameters denoted as (δd, δm) for the general class of transition systems where the observable output is given by disc...
Maria Domenica Di Benedetto, Stefano Di Gennaro, A...
DFT
2006
IEEE
122views VLSI» more  DFT 2006»
13 years 11 months ago
Efficient and Robust Delay-Insensitive QCA (Quantum-Dot Cellular Automata) Design
The concept of clocking for QCA, referred to as the four-phase clocking, is widely used. However, inherited characteristics of QCA, such as the way to hold state, the way to synch...
Minsu Choi, Myungsu Choi, Zachary D. Patitz, Nohpi...
DLOG
2007
13 years 10 months ago
Blocking Automata for PSPACE DLs
In Description Logics (DLs), both tableau-based and automata-based algorithms are frequently used to show decidability and complexity results for basic inference problems such as c...
Franz Baader, Jan Hladik, Rafael Peñaloza