On the hierarchy of Petri net languages
RAIRO. Inform. théor., 13 1 (1979) 19-30
Published online: 2017-02-01
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:
This article has been cited by the following article(s):
Watson-crick partial petri net languages and their properties
A. Mahadeer, R. Arulprakasam and V. R. DareInternational Journal of Information Technology 17 (4) 2553 (2025)
https://doi.org/10.1007/s41870-024-02272-4
Partial Petri Net Languages and their Properties
A. Mahadeer, R. Arulprakasam and V. R. DareInternational Journal of Information Technology 16 (6) 3663 (2024)
https://doi.org/10.1007/s41870-024-01903-0
Regular languages as images of local functions over small alphabets
Stefano Crespi Reghizzi and Pierluigi San PietroInformation and Computation 105206 (2024)
https://doi.org/10.1016/j.ic.2024.105206
Tools and Algorithms for the Construction and Analysis of Systems
Rupak Majumdar, Ramanathan S. Thinniyam and Georg ZetzscheLecture Notes in Computer Science, Tools and Algorithms for the Construction and Analysis of Systems 12651 449 (2021)
https://doi.org/10.1007/978-3-030-72016-2_24
341 (2020)
https://doi.org/10.1145/3373718.3394776
Automata, Languages, and Programming
Georg ZetzscheLecture Notes in Computer Science, Automata, Languages, and Programming 9135 440 (2015)
https://doi.org/10.1007/978-3-662-47666-6_35
1682 040015 (2015)
https://doi.org/10.1063/1.4932488
Fundamentals of Computation Theory
Wojciech Czerwiński, Wim Martens, Lorijn van Rooijen and Marc ZeitounLecture Notes in Computer Science, Fundamentals of Computation Theory 9210 173 (2015)
https://doi.org/10.1007/978-3-319-22177-9_14
9118 243 (2015)
https://doi.org/10.1007/978-3-319-19225-3_21
Consensual languages and matching finite-state computations
Stefano Crespi Reghizzi and Pierluigi San PietroRAIRO - Theoretical Informatics and Applications 45 (1) 77 (2011)
https://doi.org/10.1051/ita/2011012
Applications and Theory of Petri Nets
Matthias Jantzen and Georg ZetzscheLecture Notes in Computer Science, Applications and Theory of Petri Nets 5062 270 (2008)
https://doi.org/10.1007/978-3-540-68746-7_19
Refining the hierarchy of blind multicounter languages and twist-closed trios
Matthias Jantzen and Alexy KurganskyyInformation and Computation 185 (2) 159 (2003)
https://doi.org/10.1016/S0890-5401(03)00087-7
STACS 2001
Matthias Jantzen and Alexy KurganskyyLecture Notes in Computer Science, STACS 2001 2010 376 (2001)
https://doi.org/10.1007/3-540-44693-1_33
STACS 98
Matthias JantzenLecture Notes in Computer Science, STACS 98 1373 344 (1998)
https://doi.org/10.1007/BFb0028573
Foundations of Computer Science
Matthias JantzenLecture Notes in Computer Science, Foundations of Computer Science 1337 135 (1997)
https://doi.org/10.1007/BFb0052082
X-automata on ω-words
Joost Engelfriet and Hendrik Jan HoogeboomTheoretical Computer Science 110 (1) 1 (1993)
https://doi.org/10.1016/0304-3975(93)90349-X
Representation of nonstructured concurrency by Petri net languages
Hyung Lee-Kwang and J. FavrelIEEE Transactions on Systems, Man, and Cybernetics 23 (3) 872 (1993)
https://doi.org/10.1109/21.256558
A structure to decide reachability in Petri nets
J.L. LambertTheoretical Computer Science 99 (1) 79 (1992)
https://doi.org/10.1016/0304-3975(92)90173-D
Mathematical Foundations of Computer Science 1990
Ivana ČernĀLecture Notes in Computer Science, Mathematical Foundations of Computer Science 1990 452 195 (1990)
https://doi.org/10.1007/BFb0029608
Automata, Languages and Programming
Joost Engelfriet and Hendrik Jan HoogeboomLecture Notes in Computer Science, Automata, Languages and Programming 372 289 (1989)
https://doi.org/10.1007/BFb0035767
The family of one-counter languages is closed under quotient
M. Latteux, B. Leguy and B. RatoandromananaActa Informatica 22 (5) 579 (1985)
https://doi.org/10.1007/BF00267045
CTS systems and Petri nets
Ij.J. Aalbersberg and G. RozenbergTheoretical Computer Science 40 149 (1985)
https://doi.org/10.1016/0304-3975(85)90163-X
Extending regular expressions with iterated shuffle
Matthias JantzenTheoretical Computer Science 38 223 (1985)
https://doi.org/10.1016/0304-3975(85)90221-X
Remarks on two-way automata with weak-counters
Satoru MiyanoInformation Processing Letters 18 (2) 105 (1984)
https://doi.org/10.1016/0020-0190(84)90032-2
Infinite behaviour of Petri nets
Rüdiger ValkTheoretical Computer Science 25 (3) 311 (1983)
https://doi.org/10.1016/0304-3975(83)90115-9
Automata, Languages and Programming
J. GabarroLecture Notes in Computer Science, Automata, Languages and Programming 154 226 (1983)
https://doi.org/10.1007/BFb0036911
Langages á un Compteur
Michel LatteuxJournal of Computer and System Sciences 26 (1) 14 (1983)
https://doi.org/10.1016/0022-0000(83)90018-1
Two-way deterministic multi-weak-counter machines
Satoru MiyanoTheoretical Computer Science 21 (1) 27 (1982)
https://doi.org/10.1016/0304-3975(82)90086-X
A normal form theorem for label grammars
Matthias Jantzen and Manfred OppMathematical Systems Theory 14 (1) 289 (1981)
https://doi.org/10.1007/BF01752402
Theoretical Computer Science
Michel LatteuxLecture Notes in Computer Science, Theoretical Computer Science 104 52 (1981)
https://doi.org/10.1007/BFb0017296
The power of synchronizing operations on strings
Matthias JantzenTheoretical Computer Science 14 (2) 127 (1981)
https://doi.org/10.1016/0304-3975(81)90054-2
Unary multiple equality sets: The languages of rational matrices
Franz-Josef BrandenburgInformation and Control 50 (3) 199 (1981)
https://doi.org/10.1016/S0019-9958(81)90335-1
Petri nets and regular languages
Rüdiger Valk and Guy Vidal-NaquetJournal of Computer and System Sciences 23 (3) 299 (1981)
https://doi.org/10.1016/0022-0000(81)90067-2