Topics of interest include but are not limited to:
Papers can be submitted via EasyChair.
|Submission||August 4, 2018|
|Notification||August 31, 2018|
|Workshop||October 28 & 29, 2018|
One of the most significant developments in the area of design verification over the last three decade is the development of algorithmic methods for verifying temporal specification of finite-state designs. A frequent criticism against this approach, however, is that verification is done after significant resources have already been invested in the development of the design. Since designs invariably contains errors, verification simply becomes part of the debugging process. The critics argue that the desired goal is to use temporal specification in the design development process in order to guarantee the development of correct designs. This is called temporal synthesis. In this talk I will review 60 years of research on the temporal synthesis problem, describe the automata-theoretic approach developed to solve this problem, and describe both successes and failures of this research program
Sequential decision models for decentralized decision making such as DEC-POMDP are powerful and elegant approaches for planning in situations that involve multiple cooperating decision makers. They are powerful in the sense that we can, in principle, capture a rich class of problems. They are elegant in the sense that they include the minimal set of ingredients needed to analyze these problems and facilitate rigorous mathematical examination of their fundamental properties. An optimal solution of a DEC-POMDP explicitly answers the question of what should an agent do to maximize value. Implicitly, an optimal solution answers many other questions including the appropriate assignment of meaning to internal memory states, appropriate adoption of goals and subgoals, appropriate assignment of roles to agents, and appropriate assignment of meaning to messages that agents exchange. In fact, an optimal policy implicitly optimizes all these choices, albeit at a very high computational cost. In this talk, I review progress in this area and argue that there is much to be gained by adding structure to the planning problem and explicitly resolving some of these questions so as to simplify an otherwise intractable planning problem.
|Giuseppe De Giacomo||University of Rome "La Sapienza"|
|Andreas Herzig||IRIT, CNRS, Universite Paul Sabatier|
|Yves Lesperance||York University|
|Marco Montali||Free University Bozen-Bolzano|
|Fabio Patrizi||University of Rome "La Sapienza"|
|Sasha Rubin||University of Naples "Federico II"|
|Siddharth Srivastava||Arizona State University|