Sciweavers

159 search results - page 14 / 32
» Weak Equivalences in Psi-Calculi
Sort
View
105
Voted
EURODAC
1994
IEEE
123views VHDL» more  EURODAC 1994»
15 years 4 months ago
Testing redundant asynchronous circuits by variable phase splitting
An approach for stuck-at-i and delay-fault testing of redundant circuits without modifying the logic is proposed. The only requirement is the ability to control both phases of eac...
Luciano Lavagno, Antonio Lioy, Michael Kishinevsky
CONCUR
2004
Springer
15 years 4 months ago
Extended Process Rewrite Systems: Expressiveness and Reachability
Abstract. We unify a view on three extensions of Process Rewrite Systems (PRS) and compare their expressive power with that of PRS. We show that the class of Petri nets is less exp...
Mojmír Kretínský, Vojtech Reh...
EJC
2007
15 years 2 months ago
Comparing the Use of Feature Structures in Nativism and in Database Semantics
Linguistics has always been a field with a great diversity of schools and sub-schools. This has naturally led to the question of whether different grammatical analyses of the sam...
Roland Hausser
90
Voted
ACS
2010
15 years 25 days ago
Fibrations of Simplicial Sets
There are infinitely many variants of the notion of Kan fibration that, together with suitable choices of cofibrations and the usual notion of weak equivalence of simplicial sets, ...
Tibor Beke
114
Voted
DAM
2006
79views more  DAM 2006»
15 years 22 days ago
A simple expected running time analysis for randomized "divide and conquer" algorithms
There are many randomized "divide and conquer" algorithms, such as randomized Quicksort, whose operation involves partitioning a problem of size n uniformly at random int...
Brian C. Dean