Pages that link to "Item:Q3766825"
From MaRDI portal
The following pages link to “Sometimes” and “not never” revisited (Q3766825):
Displaying 50 items.
- Axiomatization of a branching time logic with indistinguishability relations (Q288245) (← links)
- Reasoning about equilibria in game-like concurrent systems (Q345709) (← links)
- Branching-time logics with path relativisation (Q386037) (← links)
- A tableau-based decision procedure for CTL\(^*\) (Q432138) (← links)
- Reliability-aware automatic composition approach for web services (Q439793) (← links)
- \textit{Once} and \textit{for all} (Q439961) (← links)
- Linear temporal logic symbolic model checking (Q465680) (← links)
- Bounded semantics (Q483292) (← links)
- Mitigating covert channels based on analysis of the potential for communication (Q530557) (← links)
- CTRL: extension of CTL with regular expressions and fairness operators to verify genetic regulatory networks (Q548484) (← links)
- Finite identification from the viewpoint of epistemic update (Q553305) (← links)
- The situation calculus: a case for modal logic (Q616039) (← links)
- Preface to the special issue: Temporal logics of agency (Q616042) (← links)
- Completeness of a branching-time logic with possible choices (Q622622) (← links)
- Maximal traces and path-based coalgebraic temporal logics (Q639645) (← links)
- Where logic and agents meet (Q657584) (← links)
- A hierarchy of temporal logics with past (Q672329) (← links)
- About the expressive power of CTL combinators (Q672975) (← links)
- On timed alternating simulation for concurrent timed games (Q715043) (← links)
- Point algebras for temporal reasoning: Algorithms and complexity (Q814509) (← links)
- A unifying semantics for time and events (Q814548) (← links)
- Combining symmetry reduction and under-approximation for symbolic model checking (Q816210) (← links)
- Complexity analysis of a unifying algorithm for model checking interval temporal logic (Q821561) (← links)
- Feature interaction detection by pairwise analysis of LTL properties -- A case study (Q853722) (← links)
- A clausal resolution method for branching-time logic \(\text{ECTL}^+\) (Q862827) (← links)
- On the freeze quantifier in Constraint LTL: Decidability and complexity (Q868025) (← links)
- Branching versus linear logics yet again (Q911747) (← links)
- Reasoning about networks with many identical finite state processes (Q921983) (← links)
- Deductive verification of alternating systems (Q939163) (← links)
- Arity hierarchy for temporal logics (Q944387) (← links)
- Automatic verification of distributed systems: the process algebra approach. (Q960505) (← links)
- Pushdown module checking (Q968362) (← links)
- Differential dynamic logic for hybrid systems (Q1040772) (← links)
- A decidable class of problems for control under partial observation (Q1041809) (← links)
- Branching-time logics repeatedly referring to states (Q1047801) (← links)
- Uniform inevitability is tree automaton ineffable (Q1108048) (← links)
- The complexity of reasoning about knowledge and time. I: Lower bounds (Q1119565) (← links)
- Compositionality and bisimulation: A negative result (Q1182130) (← links)
- Formal timing analysis of distributed systems (Q1193762) (← links)
- \(R\)-generability, and definability in branching time logics (Q1197983) (← links)
- Verification of distributed programs using representative interleaving sequences (Q1200917) (← links)
- Reasoning about nondeterministic and concurrent actions: A process algebra approach (Q1277769) (← links)
- Proving partial order properties (Q1322161) (← links)
- CTL\(^*\) and ECTL\(^*\) as fragments of the modal \(\mu\)-calculus (Q1325848) (← links)
- Model checking for action-based logics (Q1326587) (← links)
- Assisting requirement formalization by means of natural language translation (Q1329090) (← links)
- A branching time logic with past operators (Q1337463) (← links)
- Property preserving abstractions for the verification of concurrent systems (Q1346649) (← links)
- Counting on CTL\(^*\): On the expressive power of monadic path logic (Q1398378) (← links)
- Towards categorical models for fairness: Fully abstract presheaf semantics of SCCS with finite delay (Q1398465) (← links)
