Projects per year

## Abstract / Description of output

A timed network consists of an arbitrary number of initially identical 1-clock timed automata, interacting via hand-shake communication. In this setting there is no unique central controller, since all automata are initially identical. We consider the universal safety problem for such controller-less timed networks, i.e., verifying that a bad event (enabling some given transition) is impossible regardless of the size of the network.

This universal safety problem is dual to the existential coverability problem for timed-arc Petri nets, i.e., does there exist a number

This universal safety problem is dual to the existential coverability problem for timed-arc Petri nets, i.e., does there exist a number

*m*of tokens, such that starting with*m*tokens in a given place, and none in the other places, some given transition is eventually enabled. We show that these problems are PSPACE-complete.Original language | English |
---|---|

Title of host publication | 29th International Conference on Concurrency Theory (CONCUR 2018) |

Editors | Sven Schewe, Lijun Zhang |

Publisher | Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Germany |

Pages | 6:1--6:15 |

Number of pages | 15 |

ISBN (Print) | 978-3-95977-087-3 |

DOIs | |

Publication status | Published - 31 Aug 2018 |

Event | 29th International Conference on Concurrency Theory (CONCUR 2018) - Beijing, China Duration: 4 Sept 2018 → 7 Sept 2018 http://lcs.ios.ac.cn/concur2018/ |

### Publication series

Name | Leibniz International Proceedings in Informatics (LIPIcs) |
---|---|

Publisher | Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik |

Volume | 118 |

ISSN (Print) | 1868-8969 |

### Conference

Conference | 29th International Conference on Concurrency Theory (CONCUR 2018) |
---|---|

Abbreviated title | CONCUR 2018 |

Country/Territory | China |

City | Beijing |

Period | 4/09/18 → 7/09/18 |

Internet address |

## Fingerprint

Dive into the research topics of 'Universal Safety for Timed Petri Nets is PSPACE-complete'. Together they form a unique fingerprint.## Projects

- 1 Finished