Vectorial languages and linear temporal logic

DOI10.1016/S0304-3975(03)00346-3zbMath1071.68051OpenAlexW1991413205MaRDI QIDQ1884965

Olivier Serre

Publication date: 27 October 2004

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0304-3975(03)00346-3

zbMATH Keywords

Linear temporal logic and extensionsParallel automata simulation

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60) Temporal logic (03B44)

Cites Work

• Families of recognizable sets corresponding to certain varieties of finite monoids
• On the expressive power of temporal logic
• VECTOR ALGORITHMS FOR APPROXIMATE STRING MATCHING
• The complexity of propositional linear temporal logics
• On finite monoids having only trivial subgroups
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Vectorial languages and linear temporal logic