Sciweavers

799 search results - page 10 / 160
» A Logic for Abstract State Machines
Sort
View
ARVLSI
1995
IEEE
179views VLSI» more  ARVLSI 1995»
13 years 11 months ago
Algorithms for the optimal state assignment of asynchronous state machines
This paper presents a method for the optimal state assignment of asynchronous state machines. Unlike state assignment for synchronous state machines, state codes must be chosen ca...
Robert M. Fuhrer, Bill Lin, Steven M. Nowick
ATVA
2006
Springer
87views Hardware» more  ATVA 2006»
13 years 11 months ago
Timed Temporal Logics for Abstracting Transient States
Houda Bel Mokadem, Béatrice Bérard, ...
DAGSTUHL
2008
13 years 8 months ago
08061 Abstracts Collection -- Types, Logics and Semantics for State
Amal Ahmed, Nick Benton, Martin Hofmann, Greg Morr...
VLSID
1997
IEEE
98views VLSI» more  VLSID 1997»
13 years 11 months ago
Synthesis for Logical Initializability of Synchronous Finite State Machines
—Logical initializability is the property of a gate-level circuit whereby it can be driven to a unique start state when simulated by a three-valued (0, 1, ) simulator. In practic...
Montek Singh, Steven M. Nowick
EUROGP
2007
Springer
116views Optimization» more  EUROGP 2007»
14 years 1 months ago
Genetic Programming with Fitness Based on Model Checking
Abstract. Model checking is a way of analysing programs and programlike structures to decide whether they satisfy a list of temporal logic statements describing desired behaviour. ...
Colin G. Johnson