|
|
Topics
The cost of punctuality.
(with P. Bouyer, N. Markey and J. Ouaknine)
Submitted, 2007.
Zone-based universality analysis for
single-clock timed automata.
(with P. A. Abdulla, J. Ouaknine and K. Quaas)
Proceedings of FSEN 07, LNCS xxxx, 2007.
On the decidability and complexity of Metric Temporal Logic over
finite words. (PDF version here
.)
(with Joel Ouaknine).
In Logical Methods in
Computer Science 3(1).
On Metric Temporal Logic and faulty Turing
machines. (PDF version
here .)
(with Joel Ouaknine).
Proceedings of FOSSACS 06, LNCS 3921.
Safety Metric Temporal Logic is fully decidable
. (PDF version here .)
(with Joel Ouaknine).
Proceedings of TACAS 06, LNCS 3920.
Decidability and complexity results for
timed automata via channel systems.
(PDF version here .)
(with Parosh Abdulla, Johann Deneux and Joel Ouaknine).
Proceedings of ICALP `05,
LNCS 3580, Springer, 2005
On the decidability of Metric Temporal
Logic. (PDF version here .)
(with Joel Ouaknine).
Proceedings of LICS 2005,
IEEE Computer Society Press, 2005.
On the language inclusion problem for
timed automata: Closing a decidability gap
. (PDF version here. )
(with Joel Ouaknine).
Proceedings of LICS 2004, IEEE Computer Society Press, 2004.
Timed CSP = closed timed epsilon-automata
. (PDF version
here.)
(with Joel
Ouaknine).
Nordic Journal of Computing, Volume 10, Number 2,
2003.
Revisiting digitization, robustness
and decidability for timed automata.
(PDF version here.)
(with Joel Ouaknine)
Proceedings of LICS 2003, IEEE Computer Society Press, 2003.
Universality and Language Inclusion for Open and
Closed Timed Automata. (PDF version here .)
(with Joel Ouaknine)
Proceedings of
HSCC 03, LNCS 2623, 2003.
Timed CSP = closed timed automata
(with Joel
Ouaknine).
Proceedings of EXPRESS 02, ENTCS 68(2), 2002.
Nets with tokens which carry
data. (PDF version here .)
(with Ranko Lazic, Tom Newcomb, Joel Ouaknine,
A.W. Roscoe).
Proceedings of ICATPN 07, LNCS 4546, 2007.
Labelled Markov processes as generalised
stochastic relations.
(with Dusko Pavlovic and Michael
Mislove)
In Computation, Meaning, and Logic: Articles dedicated
to Gordon Plotkin, ENTCS
172, 2007.
Approximating a behavioural pseudometric
without discount.
(with Franck van Breugel and Babita
Sharma)
Accepted to FOSSACS'07.
Approximating and computing behavioural distances in probabilistic
transition systems.
(with Franck van Breugel)
Theoretical Computer Science 360(1-3):373-385, 2006.
An accessible approach to behavioural pseudometrics.
(with Franck van Breugel, Claudio Hermida and Michael Makkai).
Proceeding of
ICALP 2005, LNCS 3580, Springer, 2005.
Domain theory, simulation and testing for labelled Markov
processes.
(with Franck Van Breguel, Michael Mislove and
Joel Ouaknine)
Theoretical Computer Science 333(1-2): 171--197, 2005
A behavioural pseudometric for probabilistic transition systems.
(with Franck van Breugel)
Theoretical Computer Science 331(1):115--142, 2005.
Duality
for Labelled Markov Processes.
(with Michael Mislove, Joel
Ouaknine and Dusko Pavlovic)
Proceedings of FOSSACS 04, LNCS 2987, 2004.
Measuring the probabilistic
powerdomain.
(with Keye Martin and Michael Mislove)
Theoretical Computer Science 312(1):99--119, 2004.
Axioms for probability and
nondeterminism.
(with Michael Mislove and Joel Ouaknine)
Proceedings of EXPRESS 03, ENTCS 91(3), 2003.
An intrinsic characterization of
approximate probabilistic bisimilarity
(with Franck van
Breugel, Mike Mislove and Joel Ouaknine)
Proceedings of FOSSACS
03, LNCS 2620, Springer Verlag, 2003.
Testing labelled Markov processes
(with F. van
Breugel and Steven Shalit)
Proceedings of ICALP 02, LNCS 2380,
Springer Verlag, 2002.
Measuring the probabilistic
powerdomain
(with K. Martin and M. Mislove)
Proceedings ICALP 02, LNCS 2380, Springer Verlag, 2002.
Towards quantitative verification of probabilistic transition
systems
(with F. van Breugel)
Proceedings of ICALP 01,
LNCS 2076, Springer Verlag, 2001.
An algorithm for quantitative
verification of probabilistic transition systems.
(with
F. van Breugel)
Proceedings CONCUR 01, LNCS 2154, Springer
Verlag, 2001.
On the final sequence of a finitary set
functor. (PDF version here .)
Theoretical Computer Science 338(1-3): 184--199, 2005.
A Note on Coalgebras and Presheaves
. (PDF version here.)
Mathematical Structures in Computer Science,
15:475--483, 2005.
On the structure of categories of coalgebras
(with
P.T. Johnstone, J. Power, T. Tujishita, H. Watanabe)
Theoretical Computer Science 260:87--117, 2001.
Coinduction for recursive data types: partial orders, metric
spaces and omega-categories.
Proceedings of CMCS 00, ENTCS 33, April
2000.
An axiomatics for categories of coalgebras
(with
P.T. Johnstone, J. Power, T. Tujishita, H. Watanabe)
Proceedings
of LICS 98, IEEE Computer Society Press, 1998.
Toposes of coalgebras and hidden algebras
Proceedings
of CMCS 98, ENTCS 11,
1998.
Last updated in April, 2005, by
jbw@mcomlab.ox.ac.uk
|
|
|
|
