Sciweavers

16 search results - page 3 / 4
» On Transition Minimality of Bideterministic Automata
Sort
View
GLVLSI
2003
IEEE
134views VLSI» more  GLVLSI 2003»
14 years 22 days ago
Modeling QCA for area minimization in logic synthesis
Concerned by the wall that Moore’s Law is expected to hit in the next decade, the integrated circuit community is turning to emerging nanotechnologies for continued device impro...
Nadine Gergel, Shana Craft, John Lach
FSTTCS
2008
Springer
13 years 8 months ago
Average-Time Games
An average-time game is played on the infinite graph of configurations of a finite timed automaton. The two players, Min and Max, construct an infinite run of the automaton by ...
Marcin Jurdzinski, Ashutosh Trivedi
CONCUR
2006
Springer
13 years 9 months ago
Model Checking Quantified Computation Tree Logic
Propositional temporal logic is not suitable for expressing properties on the evolution of dynamically allocated entities over time. In particular, it is not possible to trace such...
Arend Rensink
SAGA
2005
Springer
14 years 28 days ago
Self-replication, Evolvability and Asynchronicity in Stochastic Worlds
We consider temporal aspects of self-replication and evolvability – in particular, the massively asynchronous parallel and distributed nature of living systems. Formal views of s...
Chrystopher L. Nehaniv
ATVA
2006
Springer
102views Hardware» more  ATVA 2006»
13 years 11 months ago
A Semantic Framework for Test Coverage
Abstract. Since testing is inherently incomplete, test selection is of vital importance. Coverage measures evaluate the quality of a test suite and help the tester select test case...
Laura Brandán Briones, Ed Brinksma, Mari&eu...