Petri net algorithms in the theory of matrix grammars-Reference-Cited by-同舟云学术

Petri net algorithms in the theory of matrix grammars

Published:1994-08 Issue:8 Volume:31 Page:719-728
ISSN:0001-5903
Container-title:Acta Informatica
language:en
Short-container-title:Acta Informatica

Author:

Hauschildt Dirk,Jantzen Matthias

Publisher

Springer Science and Business Media LLC

Subject

Computer Networks and Communications,Information Systems,Software

Link

http://link.springer.com/content/pdf/10.1007/BF01178731.pdf

Reference14 articles.

1. Dassow, J., Pâun, G.: Regular rewriting in formal language theory. (EATCS Monographs on Theoretical Computer Science) Berlin, Heidelberg, New York: Springer 1989

2. Ginsburg, S., Greibach, S., Harrison, M.A.: One-way stack automata. J. ACM14, 389?418 (1967)

3. Hauschildt, D. Semilinearity of the reachability set is decidable for Petri nets. Doctoral Thesis, Dept. of Computer Science, University of Hamburg (1990). Also appeared as: Dept. of Computer Science, University of Hamburg, Technical Report No. FBI-HH-B-146/90

4. Kosaraju, S.R. Decidability of reachability in vector addition systems. Proc. 14th Ann. ACM STOC (1982), pp. 267-281

5. Kleine Büning, H., Lettmann, T., Mayr, E.: Projections of vector addition system reachability sets are semilinear, TCS64, 343?350 (1989)

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

1. Verifying Unboundedness via Amalgamation;Proceedings of the 39th Annual ACM/IEEE Symposium on Logic in Computer Science;2024-07-08

2. On the computational completeness of generalized forbidding matrix grammars;Theoretical Computer Science;2024-06

3. On maximal parallel application of rules in rewriting P systems;Journal of Membrane Computing;2023-08-24

4. Adding Matrix Control: Insertion-Deletion Systems with Substitutions III;Algorithms;2021-04-22

5. Adding Matrix Control: Insertion-Deletion Systems with Substitutions III;SOFSEM 2021: Theory and Practice of Computer Science;2021