Planners are asked to find deadlocks in communication protocols, translated into PDDL from the Promela specification language. Deadlocks were specified via blocked transitions and processes. The representation chosen for the processes are finite state transition systems, while communication channels are modelled by queues with moving head and tail pointers. The communication protocols used in IPC-4 were the dining philosophers problem, as well as an optical telegraph routing problem.
Stefan Edelkamp
| file | original name |
|---|---|
| domain-1.pddl | P01_DOMAIN.PDDL |
| domain-2.pddl | P02_DOMAIN.PDDL |
| domain-3.pddl | P03_DOMAIN.PDDL |
| domain-4.pddl | P04_DOMAIN.PDDL |
| domain-5.pddl | P05_DOMAIN.PDDL |
| domain-6.pddl | P06_DOMAIN.PDDL |
| domain-7.pddl | P07_DOMAIN.PDDL |
| domain-8.pddl | P08_DOMAIN.PDDL |
| domain-9.pddl | P09_DOMAIN.PDDL |
| domain-10.pddl | P10_DOMAIN.PDDL |
| domain-11.pddl | P11_DOMAIN.PDDL |
| domain-12.pddl | P12_DOMAIN.PDDL |
| domain-13.pddl | P13_DOMAIN.PDDL |
| domain-14.pddl | P14_DOMAIN.PDDL |
| domain-15.pddl | P15_DOMAIN.PDDL |
| domain-16.pddl | P16_DOMAIN.PDDL |
| domain-17.pddl | P17_DOMAIN.PDDL |
| domain-18.pddl | P18_DOMAIN.PDDL |
| domain-19.pddl | P19_DOMAIN.PDDL |
| instance-1.pddl | P01_OPT2.PDDL |
| instance-2.pddl | P02_OPT3.PDDL |
| instance-3.pddl | P03_OPT4.PDDL |
| instance-4.pddl | P04_OPT5.PDDL |
| instance-5.pddl | P05_OPT6.PDDL |
| instance-6.pddl | P06_OPT7.PDDL |
| instance-7.pddl | P07_OPT8.PDDL |
| instance-8.pddl | P08_OPT9.PDDL |
| instance-9.pddl | P09_OPT10.PDDL |
| instance-10.pddl | P10_OPT11.PDDL |
| instance-11.pddl | P11_OPT12.PDDL |
| instance-12.pddl | P12_OPT13.PDDL |
| instance-13.pddl | P13_OPT14.PDDL |
| instance-14.pddl | P14_OPT15.PDDL |
| instance-15.pddl | P15_OPT16.PDDL |
| instance-16.pddl | P16_OPT17.PDDL |
| instance-17.pddl | P17_OPT18.PDDL |
| instance-18.pddl | P18_OPT19.PDDL |
| instance-19.pddl | P19_OPT20.PDDL |