| 刘立,李国强.异步多进程时间自动机的可覆盖性问题.软件学报,2017,28(5):1080-1090 |
| 异步多进程时间自动机的可覆盖性问题 |
| Coverability Problem of Asynchronous Multi-Process Timed Automata |
| 投稿时间：2016-07-14 修订日期：2016-09-25 |
| DOI：10.13328/j.cnki.jos.005209 |
| 中文关键词: 实时 异步多进程时间自动机 时间自动机 可读边时间Petri网 可覆盖性 |
| 英文关键词:real-time asynchronous multi-process timed automata timed automata read-arc timed petri net coverability |
| 基金项目:国家自然科学基金（61472240，61672340，91318301） |
|
| 摘要点击次数: 2411 |
| 全文下载次数: 1857 |
| 中文摘要: |
| 已有的实时系统模型无法动态创建新进程.为此，基于时间自动机模型，提出了异步多进程时间自动机模型，将每个进程抽象为进程时间自动机，其部分状态能够触发新进程.考虑到队列会导致模型图灵完备，进程都被缓存在集合中，但仍可建模许多实时系统.通过将其编码到可读边时间Petri网，证明了该模型的可覆盖性问题可判定. |
| 英文摘要: |
| Existing models for real-time system are not able to create new process at runtime dynamically. This paper proposes a new model named asynchronous multi-process timed automata based on timed automata. Each process is abstracted as a process timed automata, and new process is triggered by parts of the states. Consider that queuing can make the model Turing complete, processes are buffered in a set. However the model is still powerful enough to model many real-time systems. The paper proves that model's coverability is decidable by encoding it to read-arc timed petri net. |
|
HTML 下载PDF全文 查看/发表评论 下载PDF阅读器 |
