Flexible plan verification: feasibility results
DOI10.3233/FI-2011-397zbMATH Open1230.68177OpenAlexW2139196061MaRDI QIDQ3100175FDOQ3100175
Authors: Amedeo Cesta, Simone Fratini, Andrea Orlandini, Alberto Finzi, Enrico Tronci
Publication date: 22 November 2011
Published in: Fundamenta Informaticae (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3233/fi-2011-397
Recommendations
Formal languages and automata (68Q45) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Specification and verification (program logics, model checking, etc.) (68Q60)
Cited In (6)
- Dynamic controllability via timed game automata
- Automated planning as an early verification tool for distributed control
- Title not available (Why is that?)
- Planning and execution with flexible timelines: a formal account
- A game-theoretic approach to timeline-based planning with uncertainty
- On timeline-based games and their complexity
This page was built for publication: Flexible plan verification: feasibility results
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3100175)