Reactive Temporal Logic

  title={Reactive Temporal Logic},
  author={Rob J. van Glabbeek},
Whereas standard treatments of temporal logic are adequate for closed systems, having no run-time interactions with their environment, they fall short for reactive systems, interacting with their environments through synchronisation of actions. This paper introduces reactive temporal logic, a form of temporal logic adapted for the study of reactive systems. I illustrate its use by applying it to formulate definitions of a fair scheduler, and of a correct mutual exclusion protocol. Previous… 
4 Citations

Figures and Tables from this paper

Just Testing

This paper provides a Petri net semantics for a standard process algebra extended with signals; the read arcs are necessary to capture those signals and is the coarsest precongruence preserving linear time properties when assuming justness.

Modelling Mutual Exclusion in a Process Algebra with Time-outs

I show that in a standard process algebra extended with time-outs one can correctly model mutual exclusion in such a way that starvation-freedom holds without assuming fairness or justness, even when

Quickstrom: property-based acceptance testing with LTL specifications

Quickstrom is a property-based testing system for acceptance testing of interactive applications that formally specify and test many implementations of the popular TodoMVC benchmark, used for evaluation and comparison across various web frontend frameworks and languages.

Enabling Preserving Bisimulation Equivalence

It is proved that this equivalence between strong bisimilarity and justness is justness-preserving and a congruence for all standard operators, including parallel composition.



The temporal logic of programs

  • A. Pnueli
  • Computer Science
    18th Annual Symposium on Foundations of Computer Science (sfcs 1977)
  • 1977
A unified approach to program verification is suggested, which applies to both sequential and parallel programs. The main proof method suggested is that of temporal reasoning in which the time

Three logics for branching bisimulation

  • R. NicolaF. Vaandrager
  • Philosophy
    [1990] Proceedings. Fifth Annual IEEE Symposium on Logic in Computer Science
  • 1990
Three temporal logics are introduced which induce on labeled transition systems the same identifications as branching bisimulation. The first is an extension of Hennessy-Milner logic with a kind of

Using Branching Time Temporal Logic to Synthesize Synchronization Skeletons

Ensuring liveness properties of distributed systems: Open problems

Operational and Algebraic Semantics of Concurrent Processes

  • R. Milner
  • Mathematics
    Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics
  • 1990

The Linear Time - Branching Time Spectrum II

This paper studies semantic equivalences and preorders for sequential systems with silent moves, restricting attention to the ones that abstract from successful termination, stochastic and real-time

CCS: It’s not fair!

This paper presents a simple fair scheduler—one that in suitable variations occurs in many distributed systems—of which no implementation can be expressed in CCS, unless CCS is enriched with a fairness assumption.

Abstract processes of place/transition systems

What Good is Temporal Logic?

  • L. Lamport
  • Computer Science, Philosophy
    IFIP Congress
  • 1983
This was an invited paper. It describes the state of my views on specification and verification at the time. It is notable for introducing the idea of invariance under stuttering and explaining why

Progress, Fairness and Justness in Process Algebra

This paper investigates how the necessary progress, fairness and justness assumptions can be added to or incorporated in a standard process-algebraic specification formalism and proposes a formalisation that can be applied to a wide range of process algebras.