Decidable problems on the strong connectivity of Petri net reachability sets-Reference-Cited by-同舟云学术

登录注册会员服务联系我们

Decidable problems on the strong connectivity of Petri net reachability sets

Published:1977-02 Issue:1 Volume:4 Page:99-119
ISSN:0304-3975
Container-title:Theoretical Computer Science
language:en
Short-container-title:Theoretical Computer Science

Author:

Araki Toshiro,Kasami Tadao

Publisher

Elsevier BV

Subject

General Computer Science,Theoretical Computer Science

Reference19 articles.

1. Some decision problems for Petri nets;Araki,1975

2. Some undecidable problems about Petri nets;Araki;Trans. IECE Japan,1976

3. Solvability of decision problems related to the deadlock prevention and avoidance of Petri nets — Decision problems on the strong connectivity of re achability set;Araki,1976

4. Some decision problems related to the reachability problem for Petri nets;Araki;Theoretical Computer science,1976

5. The Mathematical Theory of Context-Free Languages;Ginsburg,1966

Cited by 28 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Acyclic and Cyclic Reversing Computations in Petri Nets;Fundamenta Informaticae;2022-03-07

2. On Deadlockability, Liveness and Reversibility in Subclasses of Weighted Petri Nets;Fundamenta Informaticae;2018-07-06

3. Reversible computation vs. reversibility in Petri nets;Science of Computer Programming;2018-01

4. On Liveness and Reversibility of Equal-Conflict Petri Nets;Fundamenta Informaticae;2016-09-13

5. Petri Nets and Semilinear Sets (Extended Abstract);Theoretical Aspects of Computing – ICTAC 2016;2016

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370

www.globalauthorid.com

TOP