AbstractWe present first the logic mtl, a real-time temporal logic that is at the heart of the real-time specification language Albert. Since this logic is undecidable, we approximate it (using the theory of Abstract Interpretation) by its fictitious clock counterpart, MTLfc.We then present a symbolic tableau-based model generation decision procedure in ECLFC, which is theoretically optimal. In practice however, we see that the introduction of integer-valued prophecy variables will make it more efficient. From these variables, we reconstruct by reverting the process a logic that we call ExpSpace, which can be decided in PSpace, and has the same expressivity as MTLfc. Theory thus shows that memory space is the critical factor. However, the c...
Journal ArticleTimed Logic Conformance _x000B_TLC_x000C_ is a bisimulation-style partial order rela...
We investigate the performance implications of providing transaction atomicity for firm-deadline rea...
AbstractWe present an algorithm for checking whether an infinite transition system, defined by a gra...
AbstractWe present first the logic mtl, a real-time temporal logic that is at the heart of the real-...
AbstractAbstractReal-time finite-state systems may be specified in linear logic by means of linear i...
This paper presents a method for automatically constructing real time systems directly from their sp...
AbstractCurrent approaches for analyzing timed systems are based on an explicit enumeration of the d...
AbstractThis work investigates the suitability of rewriting logic as a semantic framework for modeli...
This paper presents work performed in the EPSRC ''Object-oriented Specification of Reactive and Real...
Temporal logic comes in two varieties: linear-time temporal logic assumes implicit universal quantif...
AbstractWe describe PCTL, a temporal logic extending CTL with connectives allowing to refer to the p...
In this paper we define the real-time {\em logic of event clocks}. This logic is inspired from {\em ...
AbstractThis paper compares the expressive power of first-order monadic logic of order, a fundamenta...
AbstractA model checking algorithm for a variant of the temporal logic of causal knowledge [25] is g...
This paper describes a technique for generating diagnostic information for the timed bisimulation eq...
Journal ArticleTimed Logic Conformance _x000B_TLC_x000C_ is a bisimulation-style partial order rela...
We investigate the performance implications of providing transaction atomicity for firm-deadline rea...
AbstractWe present an algorithm for checking whether an infinite transition system, defined by a gra...
AbstractWe present first the logic mtl, a real-time temporal logic that is at the heart of the real-...
AbstractAbstractReal-time finite-state systems may be specified in linear logic by means of linear i...
This paper presents a method for automatically constructing real time systems directly from their sp...
AbstractCurrent approaches for analyzing timed systems are based on an explicit enumeration of the d...
AbstractThis work investigates the suitability of rewriting logic as a semantic framework for modeli...
This paper presents work performed in the EPSRC ''Object-oriented Specification of Reactive and Real...
Temporal logic comes in two varieties: linear-time temporal logic assumes implicit universal quantif...
AbstractWe describe PCTL, a temporal logic extending CTL with connectives allowing to refer to the p...
In this paper we define the real-time {\em logic of event clocks}. This logic is inspired from {\em ...
AbstractThis paper compares the expressive power of first-order monadic logic of order, a fundamenta...
AbstractA model checking algorithm for a variant of the temporal logic of causal knowledge [25] is g...
This paper describes a technique for generating diagnostic information for the timed bisimulation eq...
Journal ArticleTimed Logic Conformance _x000B_TLC_x000C_ is a bisimulation-style partial order rela...
We investigate the performance implications of providing transaction atomicity for firm-deadline rea...
AbstractWe present an algorithm for checking whether an infinite transition system, defined by a gra...