Searching for authors named "James Worrell" – sorted by Relevance.
21 documents found, showing 1 through 10.
Next 10 →
-
On Coalgebras and Final Semantics: Progress Report
- …This report summarises research undertaken by the author as part of his DPhil in computation. A draft table of contents of the thesis, a proposed timetable for submission, and a list of publications are also included.…
- Add To MetaCart
-
A Note on Coalgebras, Presheaves and Modal Logic
- …10.8> T 2 (X) of two polynomial functors T 1 and T 2 . 5. The exponent X 7! T 1 (X) A for a xed set A and polynomial functor T 1 . example of a functor preserving pullbacks but not wide pullbacks Suppose we are given a functor T : A ! A, where A has all pullbacks, and an arrow : A ! TA of A. T h…
- Add To MetaCart
-
Static Livelock Analysis in Process Algebra
- …In a process algebra with hiding and recursion it is possible to create processes which compute internally without ever communicating with their environment. Such processes are said to diverge or livelock. In this paper we show how it is possible to safely classify a process as livelock-free thro…
- Add To MetaCart
-
Universality and Language Inclusion for Open and Closed Timed Automata
- …The algorithmic analysis of timed automata is fundamentally limited by the undecidability of the universality problem. For this reason and others, there has been considerable interest in restricted classes of timed automata. In this paper we study the universality problem for two prominent such …
- Cited by 4 (2 self) – Add To MetaCart
-
On the Language Inclusion Problem for Timed Automata: Closing a Decidability Gap
- …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 undecidable, we show here that it becomes decidable if A is restricted to having at most one clock. This is so…
- Cited by 9 (1 self) – Add To MetaCart
-
Safety Metric temporal logic is fully decidable
- …Abstract. Metric Temporal Logic (MTL) is a widely-studied real-time extension of Linear Temporal Logic. In this paper we consider a fragment of MTL, called Safety MTL, capable of expressing properties such as invariance and time-bounded response. Our main result is that the satisfiability problem fo…
- Cited by 5 (3 self) – Add To MetaCart
-
Timed CSP = Closed Timed Automata
- …We study the expressive power of an augmented version of Timed CSP and show that it is precisely equal to that of closed timed automata|timed automata with closed invariant and enabling clock constraints. We also show that this new version of Timed CSP is expressive enough to capture the most widely…
- Cited by 3 (0 self) – Add To MetaCart
-
On the decidability and complexity of metric temporal logic over finite words
- …Abstract. 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 non-primitive recursive complexity. We also consider the model-checking problem for MTL: whethe…
- Cited by 6 (0 self) – Add To MetaCart
-
Revisiting Digitization, Robustness, and Decidability for Timed Automata
- …We consider several questions related to the use of digitization techniques for timed automata. These very successful techniques reduce dense-time language inclusion problems to discrete time, but are applicable only when the implementation is closed under digitization and the specification is close…
- Cited by 14 (3 self) – Add To MetaCart
-
Measuring the Probabilistic Powerdomain
- …In this paper we initiate the study of measurements on the probabilistic powerdomain. We show how measurements on the underlying domain naturally extend to the probabilistic powerdomain, so that the kernel of the extension consists of exactly those normalized valuations on the kernel of the meas…
- Add To MetaCart
Showing 1 through 10.
Next 10 →
