33 citations · 99 across the 17 of their papers we have counts for
Showing 2017Show all
3 papers · 1 filter
cs.LO2017★ 21 cited
Quantifying over Boolean announcements
Hans van Ditmarsch, Tim French
Various extensions of public announcement logic have been proposed with quantification over announcements. The best-known extension is called arbitrary public announcement logic, A…
cs.LO2017
Trace Expressiveness of Timed and Probabilistic Automata
Valentin Bura, Tim French, Mark Reynolds
Automata expressiveness is an essential feature in understanding which of the formalisms available should be chosen for modelling a particular problem. Probabilistic and stochastic…
cs.LO2017
Timed Automata with Polynomial Delay and their Expressiveness
Valentin Bura, Tim French, Mark Reynolds
We consider previous models of Timed, Probabilistic and Stochastic Timed Automata, we introduce our model of Timed Automata with Polynomial Delay and we characterize the expressive…