Deterministic weak-and-marked Petri net languages are regular

Stéphane Gaubert; Alessandro Giua

doi:10.1109/9.545718

Deterministic weak-and-marked Petri net languages are regular

Stéphane Gaubert
, Alessandro Giua

Universitá di Cagliari

Résultats de recherche: Contribution à un journal › Article › Revue par des pairs

Résumé

The intersection of the class of deterministic weak and the class of deterministic marked Petri net languages is the class of regular languages. We prove this result using a lemma that characterizes regular deterministic Petri net languages.

langue originale	Anglais
Pages (de - à)	1802-1803
Nombre de pages	2
journal	IEEE Transactions on Automatic Control
Volume	41
Numéro de publication	12
Les DOIs	https://doi.org/10.1109/9.545718
état	Publié - 1 déc. 1996

Accès au document

10.1109/9.545718

Contient cette citation

@article{ef3f290c0eb3487580c00cbde182a61b,

title = "Deterministic weak-and-marked Petri net languages are regular",

abstract = "The intersection of the class of deterministic weak and the class of deterministic marked Petri net languages is the class of regular languages. We prove this result using a lemma that characterizes regular deterministic Petri net languages.",

author = "St{\'e}phane Gaubert and Alessandro Giua",

year = "1996",

month = dec,

day = "1",

doi = "10.1109/9.545718",

language = "English",

volume = "41",

pages = "1802--1803",

journal = "IEEE Transactions on Automatic Control",

issn = "0018-9286",

number = "12",

}

TY - JOUR

T1 - Deterministic weak-and-marked Petri net languages are regular

AU - Gaubert, Stéphane

AU - Giua, Alessandro

PY - 1996/12/1

Y1 - 1996/12/1

N2 - The intersection of the class of deterministic weak and the class of deterministic marked Petri net languages is the class of regular languages. We prove this result using a lemma that characterizes regular deterministic Petri net languages.

AB - The intersection of the class of deterministic weak and the class of deterministic marked Petri net languages is the class of regular languages. We prove this result using a lemma that characterizes regular deterministic Petri net languages.

U2 - 10.1109/9.545718

DO - 10.1109/9.545718

M3 - Article

AN - SCOPUS:0030392455

SN - 0018-9286

VL - 41

SP - 1802

EP - 1803

JO - IEEE Transactions on Automatic Control

JF - IEEE Transactions on Automatic Control

IS - 12

ER -

Deterministic weak-and-marked Petri net languages are regular

Résumé

Accès au document

Empreinte digitale

Contient cette citation