Articles citing this article

The Citing articles tool gives a list of articles citing the current article.
The citing articles come from EDP Sciences database, as well as other publishers participating in CrossRef Cited-by Linking Program. You can set up your personal account to receive an email alert each time this article is cited by a new article (see the menu on the right-hand side of the abstract page).

Cited article:

On the hierarchy of Petri net languages

Matthias Jantzen

RAIRO. Inform. théor., 13 1 (1979) 19-30

Published online: 2017-02-01

DOI: https://doi.org/10.1051/ita/1979130100191

This article has been cited by the following article(s):

X-automata on ω-words

Joost Engelfriet and Hendrik Jan Hoogeboom
Theoretical Computer Science 110 (1) 1 (1993)
DOI: 10.1016/0304-3975(93)90349-X
See this article

Refining the hierarchy of blind multicounter languages and twist-closed trios

Matthias Jantzen and Alexy Kurganskyy
Information and Computation 185 (2) 159 (2003)
DOI: 10.1016/S0890-5401(03)00087-7
See this article

Langages á un Compteur

Michel Latteux
Journal of Computer and System Sciences 26 (1) 14 (1983)
DOI: 10.1016/0022-0000(83)90018-1
See this article

Petri nets and regular languages

Rüdiger Valk and Guy Vidal-Naquet
Journal of Computer and System Sciences 23 (3) 299 (1981)
DOI: 10.1016/0022-0000(81)90067-2
See this article

Extending regular expressions with iterated shuffle

Matthias Jantzen
Theoretical Computer Science 38 223 (1985)
DOI: 10.1016/0304-3975(85)90221-X
See this article

Unary multiple equality sets: The languages of rational matrices

Franz-Josef Brandenburg
Information and Control 50 (3) 199 (1981)
DOI: 10.1016/S0019-9958(81)90335-1
See this article

Remarks on two-way automata with weak-counters

Satoru Miyano
Information Processing Letters 18 (2) 105 (1984)
DOI: 10.1016/0020-0190(84)90032-2
See this article

Two-way deterministic multi-weak-counter machines

Satoru Miyano
Theoretical Computer Science 21 (1) 27 (1982)
DOI: 10.1016/0304-3975(82)90086-X
See this article

A structure to decide reachability in Petri nets

J.L. Lambert
Theoretical Computer Science 99 (1) 79 (1992)
DOI: 10.1016/0304-3975(92)90173-D
See this article

CTS systems and Petri nets

Ij.J. Aalbersberg and G. Rozenberg
Theoretical Computer Science 40 149 (1985)
DOI: 10.1016/0304-3975(85)90163-X
See this article

Infinite behaviour of Petri nets

Rüdiger Valk
Theoretical Computer Science 25 (3) 311 (1983)
DOI: 10.1016/0304-3975(83)90115-9
See this article