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

Research output: Contribution to journal › Article › peer-review

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.

Original language	English
Pages (from-to)	1802-1803
Number of pages	2
Journal	IEEE Transactions on Automatic Control
Volume	41
Issue number	12
DOIs	https://doi.org/10.1109/9.545718
Publication status	Published - 1 Dec 1996

Access to Document

10.1109/9.545718

Cite this

@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

Abstract

Access to Document

Fingerprint

Cite this