Cyclic Petri Net Reachability Sets are Semi-linear Effectively Constructible

Q3 Computer Science Electronic Notes in Theoretical Computer Science Pub Date : 1997-01-01 Epub Date: 2005-05-17 DOI:10.1016/S1571-0661(05)80423-2

Zakaria Bouziane , Alain Finkel

引用次数: 0

Abstract

We prove that cyclic Petri net reachability sets are finite unions of linear combinations of integer vectors whose sizes are exponential in the size of the cyclic Petri net.

查看原文

微信好友朋友圈 QQ好友复制链接

本刊更多论文

循环Petri网可达集是半线性有效可构造的

证明了循环Petri网可达集是整数向量的线性组合的有限并，其大小与循环Petri网的大小成指数关系。

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

求助全文

约1分钟内获得全文去求助

来源期刊

Electronic Notes in Theoretical Computer Science Computer Science-Computer Science (all)

自引率

0.00%

发文量

期刊介绍： ENTCS is a venue for the rapid electronic publication of the proceedings of conferences, of lecture notes, monographs and other similar material for which quick publication and the availability on the electronic media is appropriate. Organizers of conferences whose proceedings appear in ENTCS, and authors of other material appearing as a volume in the series are allowed to make hard copies of the relevant volume for limited distribution. For example, conference proceedings may be distributed to participants at the meeting, and lecture notes can be distributed to those taking a course based on the material in the volume.

期刊最新文献

Preface Murphree's Numerical Term Logic Tableaux A Note on Constructive Interpolation for the Multi-Modal Logic Km Paracomplete Logics Dual to the Genuine Paraconsistent Logics: The Three-valued Case Building a Maximal Independent Set for the Vertex-coloring Problem on Planar Graphs