56 citations · 307 across the 14 of their papers we have counts for
Showing 2008 · cs.LOShow all
2 papers · 2 filters
cs.LO2008★ 28 cited
Model Checking Probabilistic Timed Automata with One or Two Clocks
Marcin Jurdzinski, Francois Laroussinie, Jeremy Sproston
Probabilistic timed automata are an extension of timed automata with discrete probability distributions. We consider model-checking algorithms for the subclasses of probabilistic t…
cs.LO2008★ 3 cited
Alternating Automata on Data Trees and XPath Satisfiability
Marcin Jurdzinski, Ranko Lazic
A data tree is an unranked ordered tree whose every node is labelled by a letter from a finite alphabet and an element ("datum") from an infinite set, where the latter can only be…