Data Mining and Knowledge Engineering

Open Access Open Access  Restricted Access Subscription Access
Open Access Open Access Open Access  Restricted Access Restricted Access Subscription Access

Algorithmic Approach to the Length of the Words of String Token Petri Nets


Affiliations
1 Sathyabama University, Jeppiar Nagar, Chennai-119, India
2 S&H Department, Bharath University, Selaiyur, Chennai-73, India
     

   Subscribe/Renew Journal


In string token Petri nets (STPN), strings are used as tokens. In a Petri net, the sequence of firing of transitions which leads to the final marking forms a language. Whereas in string token Petri nets (STPN), the string in the final marking of STPN forms a language. Utilizing the concept of derivation in string languages, string token Petri net (STPN) derivation languages are studied. The ranking and unranking algorithm for the type of languages are discussed and complexity results are studied.
User
Subscription Login to verify subscription
Notifications
Font Size

Abstract Views: 237

PDF Views: 2




  • Algorithmic Approach to the Length of the Words of String Token Petri Nets

Abstract Views: 237  |  PDF Views: 2

Authors

D. K. Shirley Gloria
Sathyabama University, Jeppiar Nagar, Chennai-119, India
K. Rangarajan
S&H Department, Bharath University, Selaiyur, Chennai-73, India

Abstract


In string token Petri nets (STPN), strings are used as tokens. In a Petri net, the sequence of firing of transitions which leads to the final marking forms a language. Whereas in string token Petri nets (STPN), the string in the final marking of STPN forms a language. Utilizing the concept of derivation in string languages, string token Petri net (STPN) derivation languages are studied. The ranking and unranking algorithm for the type of languages are discussed and complexity results are studied.