We study data nets, a generalisation of Petri nets in which to kens carry data from linearlyordered infinite domains and in which whole-place operation s such as resets and transfers are possible.â€¦ (More)

20th Annual IEEE Symposium on Logic in Computerâ€¦

2005

Metric temporal logic (MTL) is a prominent specification formalism for real-time systems. In this paper, we show that the satisfiability problem for MTL over finite timed words is decidable, withâ€¦ (More)

Probabilistic bisimilarity is a fundamental notion of equivalence on labelled Markov chains. It has a natural generalisation to a probabilistic bisimilarity pseudometric, whose definition involvesâ€¦ (More)

Metric Temporal Logic (MTL) is a prominent specification formalism for realtime systems. In this paper, we show that the satisfiability problem for MTL over finite timed words is decidable, withâ€¦ (More)

Proceedings of the 19th Annual IEEE Symposium onâ€¦

2004

We consider the language inclusion problem for timed automata: given two timed automata A and B, are all the timed traces accepted by B also accepted by A? While this problem is known to beâ€¦ (More)

We propose a methodology based on testing as a framework to capture the interactions of a machine represented in a denotational model and the data it manipulates. Using a duality that models machinesâ€¦ (More)

We consider the behaviour of the terminal sequence of an accessible endofunctor T on a locally presentable category K. The preservation of monics by T is sufficient to imply convergence, necessarilyâ€¦ (More)