33 citations · 99 across the 17 of their papers we have counts for
17 papers
The Undecidability of Quantified Announcements
Thomas Ågotnes, Hans van Ditmarsch, Tim French
This paper demonstrates the undecidability of a number of logics with quantification over public announcements: arbitrary public announcement logic (APAL), group announcement logic…
Q-Cogni: An Integrated Causal Reinforcement Learning Framework
Cris Cunha, Wei Liu, Tim French +1
We present Q-Cogni, an algorithmically integrated causal reinforcement learning framework that redesigns Q-Learning with an autonomous causal structure discovery method to improve…
Satisfiability of Quantified Boolean Announcements
Hans van Ditmarsch, Tim French, Rustam Galimullin
Dynamic epistemic logics consider formal representations of agents' knowledge, and how the knowledge of agents changes in response to informative events, such as public announcemen…
Aleatoric Description Logic for Probailistic Reasoning (Long Version)
Tim French, Tom Smoker
Description logics are a powerful tool for describing ontological knowledge bases. That is, they give a factual account of the world in terms of individuals, concepts and relations…
No Finite Model Property for Logics of Quantified Announcements
Hans van Ditmarsch, Tim French, Rustam Galimullin
Quantification over public announcements shifts the perspective from reasoning strictly about the results of a particular announcement to reasoning about the existence of an announ…
A modal aleatoric calculus for probabilistic reasoning: extended version
Tim French, Andrew Gozzard, Mark Reynolds
We consider multi-agent systems where agents actions and beliefs are determined aleatorically, or "by the throw of dice". This system consists of possible worlds that assign distri…
Positive Announcements
Hans van Ditmarsch, Tim French, James Hales
Arbitrary public announcement logic (APAL) reasons about how the knowledge of a set of agents changes after true public announcements and after arbitrary announcements of true epis…
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…
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…
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…
Finding Minimum and Maximum Termination Time of Timed Automata Models with Cyclic Behaviour
Omar Al-Bataineh, Mark Reynolds, Tim French
The paper presents a novel algorithm for computing best and worst case execution times (BCET/WCET) of timed automata models with cyclic behaviour. The algorithms can work on any ar…
Hourglass Automata
Yuki Osada, Tim French, Mark Reynolds +1
In this paper, we define the class of hourglass automata, which are timed automata with bounded clocks that can be made to progress backwards as well as forwards at a constant rate…
A composable language for action models
Tim French, James Hales, Edwin Tay
Action models are semantic structures similar to Kripke models that represent a change in knowledge in an epistemic setting. Whereas the language of action model logic embeds the s…
Knowledge, Awareness, and Bisimulation
Hans van Ditmarsch, Tim French, Fernando R. Velazquez-Quesada +1
We compare different epistemic notions in the presence of awareness of propositional variables: the logics of implicit knowledge (in which explicit knowledge is definable), explici…
Specifying Robustness
John C. McCabe-Dansted, Tim French, Mark Reynolds +1
This paper proposes a new logic RoCTL* to model robustness in concurrent systems. RoCTL* extends CTL* with the addition of Obligatory and Robustly operators, which quantify over fa…
Refinement Modal Logic
Laura Bozzelli, Hans van Ditmarsch, Tim French +2
In this paper we present {\em refinement modal logic}. A refinement is like a bisimulation, except that from the three relational requirements only `atoms' and `back' need to be sa…
Verifying Real-time Commit Protocols Using Dense-time Model Checking Technology
Omar I. Al-Bataineh, Mark Reynolds
The timed-based automata model, introduced by Alur and Dill, provides a useful formalism for describing real-time systems. Over the last two decades, several dense-time model check…