Petri net languages and infinite subsets of \(\mathbb{N}^m\) (Q1970198): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1006/jcss.1999.1634 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2039309162 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4835250 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4304869 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3859267 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3994777 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5639639 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4004136 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rational sets in commutative monoids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deterministic weak-and-marked Petri net languages are regular / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decidability and closure properties of weak Petri net languages in supervisory control / rank
 
Normal rank
Property / cites work
 
Property / cites work: Star-free trace languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey of Petri net methods for controlled discrete event systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4190159 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3766866 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Control of vector discrete-event systems. I. The base model / rank
 
Normal rank
Property / cites work
 
Property / cites work: A logical approach of Petri net languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3774962 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3911403 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3776657 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3727828 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3219122 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on deciding the controllability of a language K with respect to a language L / rank
 
Normal rank

Latest revision as of 14:38, 29 May 2024

scientific article
Language Label Description Also known as
English
Petri net languages and infinite subsets of \(\mathbb{N}^m\)
scientific article

    Statements

    Petri net languages and infinite subsets of \(\mathbb{N}^m\) (English)
    0 references
    0 references
    0 references
    19 March 2000
    0 references
    0 references
    Petri net languages
    0 references
    0 references