DefinePK

DefinePK hosts the largest index of Pakistani journals, research articles, news headlines, and videos. It also offers chapter-level book search.

Select Collection

Recognition Algorithm Design and Complex Analysis for Languages of S-Nets

Article Information

Get PDF View Article
Login to Add in Library

Title: Recognition Algorithm Design and Complex Analysis for Languages of S-Nets

Authors: Tingting Cui, Qingtian Zeng, Dongli Zhang

Journal: Information Technology Journal

HEC Recognition History
No recognition records found.

Publisher: Asian Network for Scientific Information (ANSInet)

Country: Pakistan

Year: 2010

Volume: 10

Issue: 1

Language: English

DOI: 10.10.3923/itj.2011.106.112

Keywords: Petri netpetri net languagelanguage recognition

Categories
Automata Theory (5) Linguistics (10232) Computer Science (14978) Mathematics (5170) Artificial Intelligence (6625)

Abstract

S-Net is a kind of structure-simple Petri nets and its behaviors are easy to be specified. In this study, we observed the classification of S-Nets and then gave the recognition method of every kind of S-Nets. A finite automaton is constructed first that can be used to recognize the language of a bounded Petri net. Based on the finite automaton constructed, the language recognition algorithm for each kind of S-Nets is proposed and the time complexity of the proposed algorithm is discussed. By several groups of experimental data, the time complexities of the proposed algorithms are checked.

Paper summary is not available for this article yet.

Loading PDF...

Loading Statistics...