scientific article; zbMATH DE number 5604077
From MaRDI portal
Publication:3395959
Cited in
(21)- LARS: a logic-based framework for analytic reasoning over streams
- One-pass and tree-shaped tableau systems for TPTL and \(\mathrm{TPTL_b+Past}\)
- On the expressiveness of TPTL and MTL
- Expressiveness of hybrid temporal logic on data words
- On the succinctness of some modal logics
- From Philosophical to Industrial Logics
- Temporal equilibrium logic with past operators
- A compositional automata-based semantics and preserving transformation rules for testing property patterns
- On the succinctness of atoms of dependency
- From Monadic Logic to PSL
- On the translation of automata to linear temporal logic
- SAT meets tableaux for linear temporal logic satisfiability
- Succinctness of cosafety fragments of LTL via combinatorial proof systems
- Expressiveness of extended bounded response \textsf{LTL}
- Modal logic is more succinct iff bi-implication is available in some form
- Boolean basis, formula size, and number of modal operators
- Succinctness issues for \(\textsf{LTL}_{\textsf{f}}\) and safety and cosafety fragments of \textsf{LTL}
- A direct translation from LTL with past to deterministic Rabin automata
- On cascades of reset automata
- Expressive equivalence between decidable freeze and metric timed temporal logics.
- On regular temporal logics with past
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3395959)
