The following pages link to M. A. Reynolds (Q790946):
Displaying 50 items.
- (Q266864) (redirect page) (← links)
- Metric temporal logic revisited (Q266865) (← links)
- A tableau-based decision procedure for CTL\(^*\) (Q432138) (← links)
- Finding minimum and maximum termination time of timed automata models with cyclic behaviour (Q507600) (← links)
- Rewrite rules for \(\mathrm{CTL}^\ast\) (Q518745) (← links)
- The complexity of temporal logic over the reals (Q636345) (← links)
- A new construction for free inverse semigroups (Q790947) (← links)
- Accelerating worst case execution time analysis of timed automata models with cyclic behaviour (Q903501) (← links)
- A decidable temporal logic of parallelism (Q1130239) (← links)
- An axiomatization for until and since over the reals without the IRR rule (Q1207338) (← links)
- Axiomatisation and decidability of \(F\) and \(P\) in cyclical time (Q1319266) (← links)
- The complexity of the temporal logic with ``until'' over general linear time (Q1400578) (← links)
- Sublogics of a branching time logic of robustness (Q1740655) (← links)
- One-pass and tree-shaped tableau systems for TPTL and \(\mathrm{TPTL_b+Past}\) (Q2029608) (← links)
- A modal aleatoric calculus for probabilistic reasoning (Q2284177) (← links)
- On timeline-based games and their complexity (Q2310766) (← links)
- Synthesis for continuous time (Q2355696) (← links)
- To be fair, use bundles (Q2408744) (← links)
- Axiomatising first-order temporal logic: Until and since over linear time (Q2563451) (← links)
- An axiomatization of PCTL* (Q2566222) (← links)
- (Q2721205) (← links)
- (Q2753192) (← links)
- An axiomatization of full Computation Tree Logic (Q2758043) (← links)
- Model Checking General Linear Temporal Logic (Q2851939) (← links)
- A tableau for general linear temporal logic (Q2863170) (← links)
- Verifying Temporal Properties in Real Models (Q2870137) (← links)
- Metric temporal reasoning with less than two clocks (Q2901203) (← links)
- Indiscrete Models: Model Building and Model Checking over Linear Time (Q2936229) (← links)
- A complete axiomatization of a temporal logic with obligation and robustness (Q2957954) (← links)
- (Q3012526) (← links)
- (Q3384170) (← links)
- (Q3384889) (← links)
- A Tableau for Bundled CTL (Q3437260) (← links)
- A Tableau for Bundled Strategies (Q3455759) (← links)
- A Temporal Logic of Robustness (Q3525010) (← links)
- The ideal structure of idempotent-generated transformation semigroups (Q3676360) (← links)
- Products of idempotent linear transformations (Q3746341) (← links)
- (Q3835817) (← links)
- (Q4218530) (← links)
- Non-definability of the class of complete bundled trees (Q4238504) (← links)
- (Q4281254) (← links)
- (Q4475175) (← links)
- (Q4518419) (← links)
- On the Products of Linear Modal Logics (Q4529490) (← links)
- Expressiveness and succinctness of a logic of robustness (Q4586143) (← links)
- (Q4636307) (← links)
- A One-Pass Tree-Shaped Tableau for LTL+Past (Q4645753) (← links)
- THE TEMPORAL LOGIC OF TWO DIMENSIONAL MINKOWSKI SPACETIME IS DECIDABLE (Q4692071) (← links)
- Axioms for Obligation and Robustness with Temporal Logic (Q4931567) (← links)
- Undecidability of compass logic (Q4943504) (← links)
