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...
Saved in:
Published in | Journal of logical and algebraic methods in programming Vol. 110; p. 100427 |
---|---|
Main Authors | , |
Format | Journal Article |
Language | English |
Published |
Elsevier Inc
01.01.2020
|
Subjects | |
Online Access | Get full text |
Cover
Loading…
Be the first to leave a comment!