One-pass and tree-shaped tableau systems for TPTL and \(\mathrm{TPTL_b+Past}\)
type: Item
instance of: scholarly article
title: One-pass and tree-shaped tableau systems for TPTL and \(\mathrm{TPTL_b+Past}\)
author: Luca Geatti
author: Nicola Gigante
author: Angelo Montanari
author: Mark Alexander Reynolds
published in: Information and Computation
publication date: 2021-06-03T00:00:00Z
Mathematics Subject Classification ID: 03B44
zbMATH DE Number: 7354965
describes a project that uses: Leviathan
MaRDI profile type: Publication
full work available at URL: j.ic.2020.104599
OpenAlex ID: W3034562037
cites work: A Simple and Optimal Complementation Algorithm for Büchi Automata
cites work: Real-time logics: Complexity and expressiveness
cites work: A really temporal logic
cites work: Q3336675
cites work: Handbook of Model Checking
cites work: Q4935259
cites work: Temporal logics in computer science. Finite-state systems
cites work: A One-Pass Tree-Shaped Tableau for LTL+Past
cites work: Propositional temporal logics: decidability and completeness
cites work: Q3711745
cites work: Q3395959
cites work: Q3384170
cites work: Q5015285
cites work: Q3838819
cites work: The complexity of propositional linear temporal logics
cites work: Temporal logic can be more expressive
cites work: Q3710510
DOI: 10.1016/J.IC.2020.104599
description: scientific article; zbMATH DE number 7354965