7.2k citations
- Centre National de la Recherche ScientifiqueFR582 papers
- University of Maryland, College ParkUS550 papers
- Centro Brasileiro de Pesquisas FísicasBR507 papers
- Imperial College LondonGB507 papers
- Institut National de Physique Nucléaire et de Physique des ParticulesFR490 papers
- University of ZurichCH473 papers
- University of KansasUS464 papers
- Charles UniversityCZ452 papers
- Fermi National Accelerator LaboratoryUS452 papers
- Commissariat à l'Énergie Atomique et aux Énergies AlternativesFR451 papers
- University of RochesterUS451 papers
- Lomonosov Moscow State UniversityRU444 papers
Showing 2013 · cs.LOShow all
3 papers · 2 filters
cs.LO2013
On the speed of constraint propagation and the time complexity of arc consistency testing
Christoph Berkholz, Oleg Verbitsky
Establishing arc consistency on two relational structures is one of the most popular heuristics for the constraint satisfaction problem. We aim at determining the time complexity o…
cs.LO2013
Synthesizing Structured Reactive Programs via Deterministic Tree Automata
Benedikt Brütsch
Existing approaches to the synthesis of reactive systems typically involve the construction of transition systems such as Mealy automata. However, in order to obtain a succinct rep…
cs.LO2013★ 2 cited
Lazy abstractions for timed automata
Frédéric Herbreteau, B. Srivathsan, Igor Walukiewicz
We consider the reachability problem for timed automata. A standard solution to this problem involves computing a search tree whose nodes are abstractions of zones. For efficiency…