Pages that link to "Item:Q1854327"
From MaRDI portal
The following pages link to Specification in CTL + past for verification in CTL. (Q1854327):
Displaying 18 items.
- \textit{Once} and \textit{for all} (Q439961) (← links)
- A hierarchy of temporal logics with past (Q672329) (← links)
- Branching-time logics repeatedly referring to states (Q1047801) (← links)
- The complexity of propositional linear temporal logics in simple cases (Q1854521) (← links)
- Alternating-time temporal logics with linear past (Q1989330) (← links)
- Taming past LTL and flat counter systems (Q2346416) (← links)
- A survey on temporal logics for specifying and verifying real-time systems (Q2418645) (← links)
- Quantification over sets of possible worlds in branching-time semantics (Q2500778) (← links)
- An axiomatization of PCTL* (Q2566222) (← links)
- Model-checking CTL* over flat Presburger counter systems (Q2901199) (← links)
- Temporal Logic and Fair Discrete Systems (Q3176360) (← links)
- On the Hybrid Extension of CTL and CTL + (Q3182944) (← links)
- Model-Checking Strategic Ability and Knowledge of the Past of Communicating Coalitions (Q3601787) (← links)
- On the Complexity of Branching-Time Logics (Q3644771) (← links)
- (Q4222919) (← links)
- Results on alternating-time temporal logics with linear past (Q5079770) (← links)
- The Complexity of CTL* + Linear Past (Q5458359) (← links)
- Abstraction Modulo Stability for Reverse Engineering (Q6487326) (← links)
