activity
19992018
most citedA New Rule for LTL Tableaux

13 citations · 29 across the 12 of their papers we have counts for

collaborators

14 papers

cs.LO2018★ 1 cited

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…

cs.LO2018

Efficient LTL Decentralized Monitoring Framework Using Formula Simplification Table

Omar Al-Bataineh, David Rosenblum, Mark Reynolds

This paper presents a new technique for optimizing formal analysis of propositional logic formulas and Linear Temporal Logic (LTL) formulas, namely the formula simplification table…

cs.LO2018★ 5 cited

One-Pass and Tree-Shaped Tableau Systems for TPTL and TPTLb+Past

Luca Geatti, Nicola Gigante, Angelo Montanari +1

In this paper, we propose a novel one-pass and tree-shaped tableau method for Timed Propositional Temporal Logic and for a bounded variant of its extension with past operators. Tim…

cs.AI2018

A game-theoretic approach to timeline-based planning with uncertainty

Nicola Gigante, Angelo Montanari, Marta Cialdea Mayer +2

In timeline-based planning, domains are described as sets of independent, but interacting, components, whose behaviour over time (the set of timelines) is governed by a set of temp…

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…