Petri net languages and infinite subsets of \(\mathbb{N}^m\)
type: Item
instance of: scholarly article
title: Petri net languages and infinite subsets of \(\mathbb{N}^m\)
zbMATH Open document ID: 0958.68120
author: Stéphane Gaubert
author: Alessandro Giua
published in: Journal of Computer and System Sciences
publication date: 2000-03-19T00:00:00Z
Mathematics Subject Classification ID: 68Q85
Mathematics Subject Classification ID: 68T35
zbMATH DE Number: 1417878
zbMATH Keywords: Petri net languages
MaRDI profile type: Publication
full work available at URL: jcss.1999.1634
OpenAlex ID: W2039309162
cites work: Q4835250
cites work: Q4304869
cites work: Q3859267
cites work: Q3994777
cites work: Q5639639
cites work: Q4004136
cites work: Rational sets in commutative monoids
cites work: Deterministic weak-and-marked Petri net languages are regular
cites work: Decidability and closure properties of weak Petri net languages in supervisory control
cites work: Star-free trace languages
cites work: A survey of Petri net methods for controlled discrete event systems
cites work: Q4190159
cites work: Q3766866
cites work: Control of vector discrete-event systems. I. The base model
cites work: A logical approach of Petri net languages
cites work: Q3774962
cites work: Q3911403
cites work: Q3776657
cites work: Q3727828
cites work: Q3219122
cites work: A note on deciding the controllability of a language K with respect to a language L
DOI: 10.1006/JCSS.1999.1634
description: scientific article; zbMATH DE number 1417878