A really abstract concurrent model and its temporal logic

Impartial Anticipation in Runtime-Verification

“…Details can be found in an extended version of the paper. Linear-time µ-calculus (νTL) [6,13]: νTL extends standard modal logic with maximal and minimal fixpoint quantifiers, and can express regular expressions. In [7], a first automata-theoretic approach to νTL is presented.…”

Expressiveness of Metric Modalities for Continuous Time

“…(3) The validity and satisfiability problem for this logic is decidable, whether we are interested in systems with finite variability, or in all systems evolving in time (a system has finite variability if it changes only at finitely many points, in any finite interval of time). For the special case of systems with finite variability these results (but not the proof methods) are in [15,3,2,14,5,18,1,7,8], regarding different logics (future, or full), and different semantics (point sequence and interval sequence).…”

Compositionality in the temporal logic of concurrent systems

“…Location predicates however introduce in the specification language the expressibility of the "flow of control". In [BKP2], for example, to construct a fully abstract temporal semantics for a particular concurrent programming language these location predicates are dispensed with by restricting sequential composition to a head-tail construction: given an atomic action a and a statement S one can construct the statement a ;S. Applying our method for describing sequential composition would generaIizes this fully abstract semantics to the language containing the usual notion of sequential composition. Another way to describe sequential composition is introduced in [BKPl]: a new temporal operator, called the chop-operator, denoted by C, is defined such that the temporal assertion >/II C>/I2 holds in a particular sequence if this sequence can be decomposed into a prefix in which >/II holds and a suffix determined by this particular prefix in which >/12 holds.…”