Complexity issues for timeline-based planning over dense time under future and minimal semantics

DOI10.1016/j.tcs.2021.12.004OpenAlexW4200471605MaRDI QIDQ2067619

Laura Bozzelli, Angelo Montanari, Adriano Peron

Publication date: 18 January 2022

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

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

zbMATH Keywords

complexitytimed automataevent-clock automatadense timetimeline-based planning

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Uses Software

• PDDL

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Planning and execution with flexible timelines: a formal account
• Event-clock automata: a determinizable class of timed automata
• A theory of timed automata
• Constraint-based attribute and interval planning
• Timeline-based planning over dense temporal domains
• Event Clock Automata: From Theory to Practice
• A really temporal logic
• The benefits of relaxing punctuality
• On the decidability and complexity of Metric Temporal Logic over finite words
• Foundations of Software Science and Computation Structures

This page was built for publication: Complexity issues for timeline-based planning over dense time under future and minimal semantics