Computation of Controllable Sublanguages for Unbounded Petri Nets Using Their Approximation Models

Shigemasa TAKAI  Yongming BAI  

Publication
IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences   Vol.E89-A   No.11   pp.3250-3253
Publication Date: 2006/11/01
Online ISSN: 1745-1337
DOI: 10.1093/ietfec/e89-a.11.3250
Print ISSN: 0916-8508
Type of Manuscript: Special Section LETTER (Special Section on Concurrent/Hybrid Systems: Theory and Applications)
Category: Concurrent Systems
Keyword: 
unbounded Petri net,  supervisory control,  controllability,  supremal controllable sublanguage,  

Full Text: PDF>>
Buy this Article




Summary: 
We study computation of a controllable sublanguage of a given non-prefix-closed regular specification language for an unbounded Petri net. We approximate the generated language of the unbounded Petri net by a regular language, and compute the supremal controllable sublanguage of the specification language with respect to the regular language approximation. This computed language is a controllable sublanguage with respect to the original generated language of the unbounded Petri net, but is not necessarily the supremal one. We then present a sufficient condition under which the computed sublanguage is the supremal controllable sublanguage with respect to the original generated language of the unbounded Petri net.