7.2k citations
- Centre National de la Recherche ScientifiqueFR493 papers
- University of Maryland, College ParkUS455 papers
- Imperial College LondonGB453 papers
- Lomonosov Moscow State UniversityRU442 papers
- Institut National de Physique Nucléaire et de Physique des ParticulesFR429 papers
- Centro Brasileiro de Pesquisas FísicasBR412 papers
- University of KansasUS408 papers
- Fermi National Accelerator LaboratoryUS398 papers
- Charles UniversityCZ394 papers
- University of RochesterUS391 papers
- Institute for High Energy PhysicsES389 papers
- Petersburg Nuclear Physics InstituteRU382 papers
Showing 2014 · cs.LOShow all
3 papers · 2 filters
cs.LO2014
Analyzing Expected Outcomes and Almost-Sure Termination of Probabilistic Programs is Hard
Benjamin Lucien Kaminski, Joost-Pieter Katoen
This paper considers the computational hardness of computing expected outcomes and deciding almost-sure termination of probabilistic programs. We show that deciding almost-sure ter…
cs.LO2014★ 34 cited
Analysis of Timed and Long-Run Objectives for Markov Automata
Dennis Guck, Hassan Hatefi, Holger Hermanns +2
Markov automata (MAs) extend labelled transition systems with random delays and probabilistic branching. Action-labelled transitions are instantaneous and yield a distribution over…
cs.LO2014★ 1 cited
Monadic Datalog Containment on Trees
André Frochaux, Martin Grohe, Nicole Schweikardt
We show that the query containment problem for monadic datalog on finite unranked labeled trees can be solved in 2-fold exponential time when (a) considering unordered trees using…