Model checking for hybrid branching-time logics

We consider hybridisations of the full branching time logic CTL⁎ and its prominent fragments CTL, CTL+ and FCTL+ through the addition of nominals, binders and jumps. We formally define three types of hybridisations by restricting the interplay between hybrid operators and path formulas contrary to p...

Full description

Saved in:
Bibliographic Details
Published inJournal of logical and algebraic methods in programming Vol. 110; p. 100427
Main Authors Kernberger, Daniel, Lange, Martin
Format Journal Article
LanguageEnglish
Published Elsevier Inc 01.01.2020
Subjects
Online AccessGet full text

Cover

Loading…