Infinity of Intermediate States Is Decidable for Petri Nets

机译：Petri网决定中间状态的无限性

获取原文

获取原文并翻译 | 示例

页面导航

摘要
著录项
相似文献
相关主题

摘要

Based on the algorithms to decide reachability for Petri nets, we show how to decide whether the number of markings reachable on paths between two given markings is finite or infinite.

机译：基于决定Petri网可达性的算法，我们展示了如何确定两个给定标记之间路径上可到达的标记数是有限的还是无限的。

著录项

来源
《International Conference on Applications and Theory of Petri Nets 2004(ICATPN 2004); 20040621-20040625; Bologna; IT》|2004年|P.426-434|共9页
会议地点 Bologna(IT);Bologna(IT)
作者
Harro Wimmel;
展开▼
作者单位

Parallel Systems, Department of Computing Science Carl von Ossietzky Universitaet Oldenburg, Germany;

展开▼
会议组织
原文格式 PDF
正文语种 eng
中图分类计算技术、计算机技术;
关键词
petri nets; reachability problem; decidability;

机译：Petri网;可达性问题;可判定性;

相似文献

外文文献
中文文献
专利

1. Structural liveness of Petri nets is ExpSPACE-hard and decidable [J] . Jancar Petr, Purser David Acta Informatica . 2019,第6期

机译：Petri网的结构活性是ExpSPACE难以确定的
2. Structural liveness of Petri nets is ExpSPACE-hard and decidable [J] . Jancar Petr, Purser David Acta Informatica . 2019,第6期

机译：Petri网的结构性活力是普遍性的 - 硬和可判定的
3. Deciding detectability for labeled Petri nets [J] . Masopust Tomas, Yin Xiang Automatica . 2019,第期

机译：决定标有Petri网的可检测性
4. Infinity of Intermediate States Is Decidable for Petri Nets [C] . Harro Wimmel International Conference on Application and Theory of Petri Nets . 2004

机译：中间状态无限是可判定的培养网
5. Automated translation of dynamic programming problems to JAVA code and their solution via an intermediate Petri net representation. [D] . Mauch, Holger. 2005

机译：通过中间Petri网表示将动态编程问题自动转换为JAVA代码及其解决方案。
6. Modeling the Metabolism of Arabidopsis thaliana: Application of Network Decomposition and Network Reduction in the Context of Petri Nets [O] . Ina Koch, Joachim Nöthen, Enrico Schleiff 2017

机译：模拟拟南芥的代谢：网络分解和网络还原在Petri网中的应用
7. Decidability and complexity of Petri nets with unordered data [O] . Rosa Velardo, Fernando, Frutos Escrig, David de 2020

机译：具有无序数据的Petri网的可判定性和复杂性
8. Decidable Problems on the Strong Connectivity of Petri Net Reachability Sets. [R] . Araki, T., Kasami, T. 1976

机译：petri网可达性集强连通性的可判定问题。

Infinity of Intermediate States Is Decidable for Petri Nets

摘要

著录项

相似文献

相关主题

期刊订阅