32 papers:
LATA-2015-VorelR #complexity #word- Complexity of Road Coloring with Prescribed Reset Words (VV, AR), pp. 161–172.
CIAA-2014-GusevP #automaton- Reset Thresholds of Automata with Two Cycle Lengths (VVG, EVP), pp. 200–210.
- LATA-2014-Vorel #automaton #complexity #problem #word
- Complexity of a Problem Concerning Reset Words for Eulerian Binary Automata (VV), pp. 576–587.
DATE-2013-ParkQPC #embedded #logic #self- 40.4fJ/bit/mm low-swing on-chip signaling with self-resetting logic repeaters embedded within a mesh NoC in 45nm SOI CMOS (SP, MQ, LSP, APC), pp. 1637–1642.
- DATE-2011-ChungCCK
- Formal reset recovery slack calculation at the register transfer level (CNC, CWC, KHC, SYK), pp. 571–574.
- CIAA-2011-Martyugin #automaton #complexity #problem #word
- Complexity of Problems Concerning Reset Words for Cyclic and Eulerian Automata (PM), pp. 238–249.
- CIAA-2011-SkvortsovT #automaton #case study #random #word
- Experimental Study of the Shortest Reset Word of Random Automata (ES, ET), pp. 290–298.
DLT-2011-TasdemirS #automaton #modelling- Models of Pushdown Automata with Reset (NT, ACCS), pp. 417–428.
- DATE-2010-ChouYCDK #case study #design #nondeterminism #scalability
- Finding reset nondeterminism in RTL designs — scalable X-analysis methodology and case study (HZC, HY, KHC, DD, SYK), pp. 1494–1499.
- DATE-2010-PomeranzR10a #functional #on the #testing
- On reset based functional broadside tests (IP, SMR), pp. 1438–1443.
- CIAA-2010-GerbushH #approximate #sequence
- Approximating Minimum Reset Sequences (MG, BH), pp. 154–162.
- LATA-2009-SumanP #automaton #integer
- Determinization and Expressiveness of Integer Reset Timed Automata with Silent Transitions (PVS, PKP), pp. 728–739.
VMCAI-2009-JurdzinskiLR #automaton #game studies #hybrid- Average-Price-per-Reward Games on Hybrid Automata with Strong Resets (MJ, RL, MR), pp. 167–181.
AFL-2008-Martyugin #automaton #commutative #complexity #problem #word- Complexity of problems concerning reset words for commutative automata and automata with simple idempotents (PVM), pp. 314–324.
DAC-2007-ChelceaVG #self- Self-Resetting Latches for Asynchronous Micro-Pipelines (TC, GV, SCG), pp. 986–989.
- DATE-2007-MoonBP #approach #composition #equivalence
- A compositional approach to the combination of combinational and sequential equivalence checking of circuits without known reset states (IHM, PB, CP), pp. 1170–1175.
ICML-2005-WolfeJS #learning #predict- Learning predictive state representations in dynamical systems without reset (BW, MRJ, SPS), pp. 980–987.
PEPM-2004-Asai #partial evaluation- Offline partial evaluation for shift and reset (KA), pp. 3–14.
- ICML-2004-JamesS #learning #predict
- Learning and discovery of predictive state representations in dynamical systems with reset (MRJ, SPS).
TACAS-2003-ArmoniBKV #linear #logic- Resets vs. Aborts in Linear Temporal Logic (RA, DB, OK, MYV), pp. 65–80.
- PEPM-2002-Asai #online #partial evaluation
- Online partial evaluation for shift and reset (KA), pp. 19–30.
ICFP-2002-GasbichlerS #implementation- Final shift for call/cc: : direct implementation of shift and reset (MG, MS), pp. 271–282.
PPDP-2000-HamonP #composition #data flow #source code- Modular resetting of synchronous data-flow programs (GH, MP), pp. 289–300.
CL-2000-LeuschelL #deduction #petri net- Coverability of Reset Petri Nets and Other Well-Structured Transition Systems by Partial Deduction (ML, HL), pp. 101–115.
ICALP-1999-DufordJS #bound- Boundedness of Reset P/T Nets (CD, PJ, PS), pp. 301–310.
- ICALP-1998-DufourdFS #decidability
- Reset Nets Between Decidability and Undecidability (CD, AF, PS), pp. 103–115.
- EDTC-1997-PomeranzR97a #finite #on the #state machine #testing
- On the use of reset to increase the testability of interconnected finite-state machines (IP, SMR), pp. 554–559.
SAC-1996-Nanavati #protocol #self- A simple self-stabilizing reset protocol (AAN), pp. 93–97.
- EDAC-1994-Stroele #analysis
- Signature Analysis for Sequential Circuits with Reset (APS), pp. 113–118.
- ICALP-1988-Eppstein #automaton #design #finite #sequence
- Reset Sequences for Finite Automata with Application to Design of Parts Orienters (DE), pp. 230–238.
- SLP-1987-Winsborough87 #parallel #semantics
- Semantically Transparent Selective Reset for AND Parallel Interpreters Based on the Origin of Failures (WHW), pp. 134–152.
- ICALP-1978-BookGW
- Comparisons and Reset Machines (Preliminary Report) (RVB, SAG, CW), pp. 113–124.
