Sciweavers

1163 search results - page 206 / 233
» Concurrent Subspaces Analysis
Sort
View
SBMF
2009
Springer
126views Formal Methods» more  SBMF 2009»
15 years 2 months ago
Undecidability Results for Distributed Probabilistic Systems
Abstract. In the verification of concurrent systems involving probabilities, the aim is to find out the maximum/minimum probability that a given event occurs (examples of such ev...
Sergio Giro
HYBRID
2001
Springer
15 years 2 months ago
Assume-Guarantee Reasoning for Hierarchical Hybrid Systems
Abstract. The assume-guarantee paradigm is a powerful divide-andconquer mechanism for decomposing a veri cation task about a system into subtasks about the individual components of...
Thomas A. Henzinger, Marius Minea, Vinayak S. Prab...
DATE
1999
IEEE
147views Hardware» more  DATE 1999»
15 years 2 months ago
Efficient BIST Hardware Insertion with Low Test Application Time for Synthesized Data Paths
In this paper, new and efficient BIST methodology and BIST hardware insertion algorithms are presented for RTL data paths obtained from high level synthesis. The methodology is ba...
Nicola Nicolici, Bashir M. Al-Hashimi
ISADS
1999
IEEE
15 years 2 months ago
Fault Tolerance in Decentralized Systems
: In a decentralised system the problems of fault tolerance, and in particular error recovery, vary greatly depending on the design assumptions. For example, in a distributed datab...
Brian Randell
ICLP
1999
Springer
15 years 2 months ago
Comparing Trailing and Copying for Constraint Programming
A central service of a constraint programming system is search. In almost all constraint programming systems search is based on trailing, which is well understood and known to be ...
Christian Schulte