Publication | Closed Access
Flat fragments of CTL and CTL: separating the expressive and distinguishing powers
21
Citations
8
References
1999
Year
EngineeringClassical LogicHigher-order LogicSemanticsFormal VerificationFormal SystemTemporal LogicLanguage StudiesProgramming Language TheoryPropositional FormulaeAbstract InterpretationComputer ScienceFunctional ProgrammingLogical FormalismFlat FragmentsAutomated ReasoningFlat Temporal LogicsFormal MethodsLinguistics
We study both the expressive and the distinguishing powers of flat temporal logics. These are fragments obtained by restricting the first argument of the Until operator to propositional formulae. Both the linear-time and the branching-time cases are considered. Keywords:temporal logic, LTL, CTL, expressiveness, bisimulation
| Year | Citations | |
|---|---|---|
Page 1
Page 1