On the Satisfiability and Model Checking for one Parameterized Extension of Linear-time Temporal Logic

DOI10.18255/1818-1015-2021-4-356-371OpenAlexW4200153695MaRDI QIDQ5870862

Anton Romanovich Gnatenko, Vladimir A. Zakharov

Publication date: 24 January 2023

Published in: Modeling and Analysis of Information Systems (Search for Journal in Brave)

Full work available at URL: http://mathnet.ru/eng/mais757

zbMATH Keywords

regular languagemodel checkingsatisfiability checkingtemporal logicstransduceremptiness problemBuchi automata

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The temporal logic of branching time
• Propositional dynamic logic of regular programs
• Dynamic linear time temporal logic
• An until hierarchy and other applications of an Ehrenfeucht-Fraïssé game for temporal logic
• Relationships between nondeterministic and deterministic tape complexities
• Equivalence Checking Problem for Finite State Transducers over Semigroups
• Temporal logic can be more expressive
• Regular Linear Temporal Logic
• Some Recent Results in Metric Temporal Logic
• On the Model Checking Problem for Some Extension of CTL*

This page was built for publication: On the Satisfiability and Model Checking for one Parameterized Extension of Linear-time Temporal Logic