---
res:
  bibo_abstract:
  - Planning in hybrid domains poses a special challenge due to the involved mixed
    discrete-continuous dynamics. A recent solving approach for such domains is based
    on applying model checking techniques on a translation of PDDL+ planning problems
    to hybrid automata. However, the proposed translation is limited because must
    behavior is only overapproximated, and hence, processes and events are not reflected
    exactly. In this paper, we present the theoretical foundation of an exact PDDL+
    translation. We propose a schema to convert a hybrid automaton with must transitions
    into an equivalent hybrid automaton featuring only may transitions.@eng
  bibo_authorlist:
  - foaf_Person:
      foaf_givenName: Sergiy
      foaf_name: Bogomolov, Sergiy
      foaf_surname: Bogomolov
      foaf_workInfoHomepage: http://www.librecat.org/personId=369D9A44-F248-11E8-B48F-1D18A9856A87
    orcid: 0000-0002-0686-0365
  - foaf_Person:
      foaf_givenName: Daniele
      foaf_name: Magazzeni, Daniele
      foaf_surname: Magazzeni
  - foaf_Person:
      foaf_givenName: Stefano
      foaf_name: Minopoli, Stefano
      foaf_surname: Minopoli
  - foaf_Person:
      foaf_givenName: Martin
      foaf_name: Wehrle, Martin
      foaf_surname: Wehrle
  dct_date: 2015^xs_gYear
  dct_language: eng
  dct_publisher: AAAI Press@
  dct_title: 'PDDL+ planning with hybrid automata: Foundations of translating must
    behavior@'
...