高维定时和混合自动机

Leibniz Trans. Embed. Syst. Pub Date : 1900-01-01 DOI:10.4230/LITES.8.2.3

U. Fahrenberg

{"title":"高维定时和混合自动机","authors":"U. Fahrenberg","doi":"10.4230/LITES.8.2.3","DOIUrl":null,"url":null,"abstract":"We introduce a new formalism of higher-dimensional timed automata, based on Pratt and van Glabbeek’s higher-dimensional automata and Alur and Dill’s timed automata. We prove that their reachability is PSPACE-complete and can be decided using zone-based algorithms. We also extend the setting to higher-dimensional hybrid automata. The interest of our formalism is in modeling systems which exhibit both real-time behavior and concurrency. Other existing formalisms for real-time modeling identify concurrency and interleaving, which, as we shall argue, is problematic. 2012","PeriodicalId":376325,"journal":{"name":"Leibniz Trans. Embed. Syst.","volume":"64 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Higher-Dimensional Timed and Hybrid Automata\",\"authors\":\"U. Fahrenberg\",\"doi\":\"10.4230/LITES.8.2.3\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We introduce a new formalism of higher-dimensional timed automata, based on Pratt and van Glabbeek’s higher-dimensional automata and Alur and Dill’s timed automata. We prove that their reachability is PSPACE-complete and can be decided using zone-based algorithms. We also extend the setting to higher-dimensional hybrid automata. The interest of our formalism is in modeling systems which exhibit both real-time behavior and concurrency. Other existing formalisms for real-time modeling identify concurrency and interleaving, which, as we shall argue, is problematic. 2012\",\"PeriodicalId\":376325,\"journal\":{\"name\":\"Leibniz Trans. Embed. Syst.\",\"volume\":\"64 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1900-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Leibniz Trans. Embed. Syst.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.4230/LITES.8.2.3\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Leibniz Trans. Embed. Syst.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.4230/LITES.8.2.3","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 2

摘要

在Pratt和van Glabbeek的高维自动机和Alur和Dill的时间自动机的基础上，提出了一种新的高维时间自动机的形式。我们证明了它们的可达性是pspace完全的，并且可以使用基于区域的算法来确定。我们还将设置扩展到高维混合自动机。我们的形式化的兴趣在于对显示实时行为和并发性的系统建模。其他用于实时建模的现有形式化识别并发性和交错性，正如我们将讨论的那样，这是有问题的。2012

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Higher-Dimensional Timed and Hybrid Automata

We introduce a new formalism of higher-dimensional timed automata, based on Pratt and van Glabbeek’s higher-dimensional automata and Alur and Dill’s timed automata. We prove that their reachability is PSPACE-complete and can be decided using zone-based algorithms. We also extend the setting to higher-dimensional hybrid automata. The interest of our formalism is in modeling systems which exhibit both real-time behavior and concurrency. Other existing formalisms for real-time modeling identify concurrency and interleaving, which, as we shall argue, is problematic. 2012

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Leibniz Trans. Embed. Syst.

自引率

0.00%

发文量