Compact and tractable automaton-based representations of time granularities

DOI10.1016/J.TCS.2006.12.014MaRDI QIDQ875518zbMATH OpenOpenAlexFDO

Authors Ugo Dal Lago, Angelo Montanari, Gabriele Puppis

Publication date 13 April 2007

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

Full work available at URL https://doi.org/10.1016/j.tcs.2006.12.014

zbMATH Keywords

automatatemporal databasestime granularities

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Database theory (68P15) Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• Towards compact and tractable automaton-based representations of time granularities.
• scientific article; zbMATH DE number 1832332
• Logics in Artificial Intelligence
• Representing and Reasoning about Temporal Granularities
• Supporting temporal reasoning by mapping calendar expressions to minimal periodic sets

Cites work

• scientific article; zbMATH DE number 1458810 (Why is no real title available?)
• scientific article; zbMATH DE number 941396 (Why is no real title available?)
• scientific article; zbMATH DE number 1832332 (Why is no real title available?)
• scientific article; zbMATH DE number 907667 (Why is no real title available?)
• scientific article; zbMATH DE number 2207163 (Why is no real title available?)
• An algebraic representation of calendars
• Fast Pattern Matching in Strings
• Introduction to algorithms
• Representing and Reasoning about Temporal Granularities
• Solving multi-granularity temporal constraint networks
• Temporalized logics and automata for time granularity
• Towards compact and tractable automaton-based representations of time granularities.
• Ultimately periodic words of rational ω-languages
• Uniqueness Theorems for Periodic Functions

Cited in

(9)

• Representing and Reasoning about Temporal Granularities
• scientific article; zbMATH DE number 1832332 (Why is no real title available?)
• A theory of ultimately periodic languages and automata with an application to time granularity
• Symbolic representation of user-defined time granularities
• An algebraic representation of calendars
• Towards compact and tractable automaton-based representations of time granularities.
• Supporting temporal reasoning by mapping calendar expressions to minimal periodic sets
• Logics in Artificial Intelligence
• Maximum satisfiability of mission-time linear temporal logic

Describes a project that uses

Uses Software

• LaGO

This page was built for publication: Compact and tractable automaton-based representations of time granularities

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q875518)