Computing Reviews
Today's Issue Hot Topics Search Browse Recommended My Account Log In
Browse by topic Browse by titles Authors Reviewers Browse by issue Browse Help
Search
  Murata, Tadao Add to Alert Profile  
 
Options:
Date Reviewed  
  1 - 4 of 4 reviews    
  Reduction Methods for Real-Time Systems Using Delay Time Petri Nets
Juan E., Tsai J., Murata T., Zhou Y. IEEE Transactions on Software Engineering 27(5): 422-448, 2001.  Type: Article

Net reduction is one of the most important techniques for reducing the state explosion problem of Petri nets. This paper proposes a new methodology for net reduction, which helps in analyzing real-time systems. The class of Petri nets ...
...
Sep 1 2001  
  A Protocol Modeling and Verification Approach Based on a Specification Language and Petri Nets
Suzuki T., Shatz S., Murata T. IEEE Transactions on Software Engineering 16(5): 523-536, 1990.  Type: Article

The authors’ approach to automated modeling and verification of communication protocols uses a version of timed Petri nets whose transitions have deterministic enabling times and firing times. The specification language EBSDL...
...
Jul 1 1991  
  Detection of Ada Static Deadlocks Using Petri Net Invariants
Murata T., Shatz S., Shenker B. IEEE Transactions on Software Engineering 15(3): 314-326, 1989.  Type: Article

The authors present a technique which uses Petri nets to detect static deadlocks in concurrent Ada programs (Ada programs which use the tasking features of the language). This method addresses two kinds of static deadlock: what the aut...
...
Apr 1 1990  
  Proof Procedure and Answer Extraction in Petri Net Model of Logic Programs
Peterka G., Murata T. IEEE Transactions on Software Engineering 15(2): 209-217, 1989.  Type: Article

A propositional logic program P consisting of Horn clauses t1, . . . ,tn containing literals p1, . . . ,pm can be described by a Petri net with places p<...
...
Jan 1 1990  

   
Send Your Comments
Contact Us
Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud®
Terms of Use
| Privacy Policy