A Verification Method Based On Petri Net for Online Student Registration Web Service Composition
Journal Title: International Journal of Advanced Research in Computer Engineering & Technology(IJARCET) - Year 2013, Vol 2, Issue 5
Abstract
The Main area in Web service is the Web service composition which detects the composition before execution. Petri net or Place / Transition net is a mathematical modeling language used to describe the distributed systems. Deadlock can be detected through transitive matrix of Petri nets .This paper proposes a Web service model for students’ online registration and detects the deadlocks for various applications using Petri net transitive matrix. Simulation results indicate a better identification of deadlock.
Authors and Affiliations
A. Kumaravel
Keywords
Related Articles
- EP ID EP115204
- DOI -
- Views 81
- Downloads 0
Ontology construction and query indexing technique to improve query indexing time, precision and number of good pages visited
For The existing search engines have many issues. In this research we have considered the issue of query processing in hakia search engines. Current search is done on ranking based query processing means displaying r...
Survey on Certain Algorithms Computing Best Possible Routes for Transportation Enquiry Services
Shortest Path problems are very common in road network applications where the optimal routings have to be found. As the traffic condition among a city changes from time to time and there are usually a huge amounts...
A Survey on Energy-Efficient protocol for Wireless Sensor Networks
Wireless Sensor Network has become one of the hot topics now a days although; it has been already applied in the use of many different areas. Such as the Home Automation, it is very common to find its use on the...
SECURE DATA DELIVERY USING GEOGRAPHIC MULTICAST ROUTING
In MANET group communication is an important characteristic which can be implemented through Multicasting. MANET has a dynamic topology through which the mobile nodes keep changing their location and thus it doesn’t have...
Dynamic Pattern Matching: Efficient Pattern Matching using Data Preprocessing with help of One time look indexing method
There are various pattern matching algorithms which take more comparisons in finding a given pattern in the text and are static and restrictive. In order to search pattern or substring of a pattern in the text wi...