P. Rondogiannis, M.H.M Cheng. Petri-net-based deadlock analysis of Process Algebra programs. Science of Computer Programming 23, 1994. 55-89. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
State Space Reduction by Non-standard Semantics for.. - De Francesco.. (1998) (Correct)
....Such approach requires a lot of memory to store the standard transition system and effort to apply the reduction algorithm. A different semantically based approach is that of translating the concurrent system description into a formalism more suitable for reduction. This occurs for example in [26], where, to check deadlock freeness of a CCS term [22] the term is first transformed into a Petri net [25] and then the obtained net is reduced using known reduction techniques for Petri nets. The works in the second category, that we can denote as following a syntactic approach (see for ....
....r def = acq:rel:r While SOS(E 3 ) has 32 states, ABS(E 3 ) shown in Figure 11, has 4 states. The resulting process is not a linear client server process with our definition (condition (1) in the definition 7. 1, is not obeyed) For n processes, the states of SOS(E n ) are 2 n (n 1) see [26]) while ABS(E n ) has n 1 states, as stated by the following proposition. Proposition 8.1 For each n 1, ABS(E n ) has n 1 states. Proof sketch. By induction on the number of the processes. 20 j i j i j i 6 Z Z Z Z Z Z Z Z ae ae ae ae ae= ae ae ae E 3 p 1 ....
[Article contains additional citation context not shown here]
P. Rondogiannis, M.H.M Cheng. Petri-net-based deadlock analysis of Process Algebra programs. Science of Computer Programming 23, 1994. 55-89.
A Non Standard-Semantics for Generating Reduced.. - De Francesco, Santone, .. (1996) (Correct)
....restriction environments (fag and fbg) in each of which some unrestricted action exists that we are able to dynamically skip. Our method is able to consider, for each subterm in which a constant occurs, just the local restriction environment, so obtaining a more reduced transition system. In [18], to check deadlock freeness of a CCS term, the term is first transformed into a Petri net [17] by means of a truly concurrent semantics of CCS, then the obtained net is reduced using known reduction techniques for Petri nets, and lastly the reduced net is checked for deadlock freeness. This ....
P. Rondogiannis, M.H.M Cheng. Petri-net-based deadlock analysis of Process Algebra programs. Science of Computer Programming, 1994. Vol. 23 (1), pp. 55-89.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC