A decidability theorem for a class of vector-addition systems-Reference-Cited by-同舟云学术

A decidability theorem for a class of vector-addition systems

Published:1975-01 Issue:3 Volume:3 Page:78-80
ISSN:0020-0190
Container-title:Information Processing Letters
language:en
Short-container-title:Information Processing Letters

Author:

Crespi-Reghizzi S.,Mandrioli D.

Publisher

Elsevier BV

Subject

Computer Science Applications,Information Systems,Signal Processing,Theoretical Computer Science

Reference8 articles.

1. Parallel program schemata;Karp;J. Comp. Syst. Sc.,1969

2. Events and conditions;Holt,1970

3. The recursive equivalence of the reachability problem and the liveness problem for Petri nets and vector addition systems;Hack;15th Annual Symp. on Switching and Automata Theory,1974

4. S. Crespi-Reghizzi and D. Mandrioli, Petri nets and commutative grammars, Rept. N. 74-5; Istituto di Elettrotecnica ed Elettronica, Politecnico di Milano.

5. Marked directed graphs;Commoner;J. Comp. Syst. Sc.,1971

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

1. Theoretical Computer Science in Italy: The Early Years;IEEE Annals of the History of Computing;2021-07-01

2. Analysis and Synthesis of Weighted Marked Graph Petri Nets: Exact and Approximate Methods;Fundamenta Informaticae;2019-10-10

3. Synthesis of Weighted Marked Graphs from Constrained Labelled Transition Systems: A Geometric Approach;Transactions on Petri Nets and Other Models of Concurrency XIV;2019

4. Sufficient conditions for the marked graph realisability of labelled transition systems;Theoretical Computer Science;2018-11

5. Simultaneous Petri Net Synthesis;Scientific Annals of Computer Science;2018-09-25