Kovalyov, A., Esparza, J.: A Polynomial Algorithm to Compute the Concurrency Relation of Free-choice Signal Transition Graphs, Proc. Int. Workshop on Discrete Event Systems, IEE Society, 1996.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....indicates that the corresponding transitions can fire simultaneously. Figure 2. Buffer of capacity 4 and its concurrency relation The problem of deciding if two given transitions of a Petri net may concurrently fire can be solved in polynomial time for live and extended free choice nets [11]. It is important to note that extended free choice is a structural property of the net and therefore easy to check, and that liveness of safe and extended free choice nets is decidable in polynomial time [3] We compute the concurrency relation of the live and extended free choice Petri net by ....

.... net and therefore easy to check, and that liveness of safe and extended free choice nets is decidable in polynomial time [3] We compute the concurrency relation of the live and extended free choice Petri net by using an algorithm that, in general, gives better results than the one presented in [11], albeit both have a worst case time complexity O(n 3 ) where n is the number of places and transitions of the net. As illustrated by the experimental results in Section 5, obtaining the concurrency relation is computationally cheap. 4.2. Grouping Transitions The naive way of grouping ....

A. Kovalyov and J. Esparza, "A polynomial algorithm to compute the concurrency relation of free-choice Signal Transition Graphs," in Proc. Intl. Workshop on Discrete Event Systems, 1996, pp. 1-6.

.... that are not concurrent can be conservatively performed by computing the structural t1 t2 t3 p1 p3 2 2 2 p2 p4 2010 3002 2104 0120 1112 0214 1206 0308 t1 t1 t1 t2 t2 t2 t2 t3 t3 t3 t2 t3 Figure 3: Potentially reachable markings (example from [12] concurrency relation [9] that gives necessary conditions for two places not to be concurrent. A complementary way is the calculation of state machines initially marked with one token. State machines correspond to place invariants that can be obtained by using algebraic methods [7, 12] Let us illustrate this feature ....

A. Kovalyov and J. Esparza. A polynomial algorithm to compute the concurrency relation of free-choice signal transition graphs. In Proc. of the International Workshop on Discrete Event Systems (WODES), pages 1--6, August 1996.

.... on the set of reachable markings as [12] #t 1 #t 2 #2CR#9M :M#t 1 t 2 i#M#t 2 t 1 i ; #p 1 #p 2 #2CR#9M :M#p 1 #=M#p 2 #=1 ; #t# p# 2CR# 9M#M 0 :M#tiM 0 #M#p#=M 0 #p#=1 # A polynomial time algorithm for the computation of the CR relations of a live and safe free choice PN is presented in [9]. The concurrency relation between signals and nodes of the STG can be indirectly studied by using the ConcurrencyRelation of the PN. The Signal Concurrency Relation is a binary relation SCRbetween signals in S and nodes in the STG, such that signal a and node u j are concurrent if #a#u j# 2SCR. ....

A. Kovalyov and J. Esparza. A polynomial algorithm to compute the concurrency relation of free-choice signal transition graphs. Technical Report TUM-I9528,SFB-Bericht Nr. 342/15/95A, Technische Universitat Munchen, 1995.

.... nets, e.g. Free choice Petri nets [11] and use structural methods that can manipulate the state space by only analyzing the underlying graph of the net and without explicitly generating the states [33] Techniques for the efficient calculation of concurrency relations are crucial in this context [21]. Annotate timing on the events, e.g. min max firing delays, and calculate the reduced state space reachable only under the specified timing constraints. This is the approach used for the synthesis of timed asynchronous circuits [30] Use symbolic methods, such as Binary Decision Diagrams ....

A. Kovalyov. A Polynomial Algorithm to Compute the Concurrency Relation of a Regular STG. In A. Yakovlev, L. Gomesa, and L. Lavagno, editors, Hardware Design and Petri Nets, pages 107--126. Kluwer Academic Publishers, March 2000.

...., exists Definition 3 (Signal Concurrency Relations) The signal concurrency relation between a node and a signal is defined as a binary relation such that . Polynomial algorithms for the computation of the concurrency relations of a live and safe free choice PN have been presented in [29]. As an example, Table II depicts the s for the places of STG in Fig. 1(a) where indicates those pairs that are concurrent] B. Consistency Verification If an STG is not consistent, it cannot be implemented by a logic circuit. Therefore, consistency must be checked before performing the ....

A. Kovalyov and J. Esparza, "A polynomial algorithm to compute the concurrency relation of free-choice signal transition graphs," in Proc. Int. Workshop Discrete Event Systems, WODES'96, Aug. 1996, pp. 1--6.

....overall analysis and synthesis methodology proposed in this work has a polynomial complexity with respect to the size of the STG, but relaying on the pre computed CR relations. Polynomial time algorithms for the computation of the CR relation of a live and safe free choice PN has been presented in [15]. The concurrency relation between signals and nodes of the STG is the basic required information to structurally approximate the signal regions. This relation can be indirectly studied by using the Concurrency Relation of the PN. Definition 8 Signal Concurrency Relations The Concurrency ....

A. Kovalyov and J. Esparza. A polynomial algorithm to compute the concurrency relation of free-choice signal transition graphs. Technical Report TUM-I9528, SFB-Bericht Nr. 342/15/95 A, Technische Universitat Munchen, 1995.

.... as [12] t 1 ; t 2 ) 2 CR , 9M : M [t 1 t 2 i M [t 2 t 1 i ; p 1 ; p 2 ) 2 CR ,9M : M(p 1 ) M(p 2 ) 1 ; t; p) 2 CR , 9M;M 0 : M [tiM 0 M(p) M 0 (p) 1 : A polynomial time algorithm for the computation of the CR relations of a live and safe free choice PN is presented in [9]. The concurrency relation between signals and nodes of the STG can be indirectly studied by using the Concurrency Relation of the PN. The Signal Concurrency Relation is a binary relation SCR between signals in S and nodes in the STG, such that signal a and node u j are concurrent if (a; u j ) ....

A. Kovalyov and J. Esparza. A polynomial algorithm to compute the concurrency relation of free-choice signal transition graphs. Technical Report TUM-I9528,SFB-Bericht Nr. 342/15/95A, Technische Universitat Munchen, 1995.

No context found.

Kovalyov, A., Esparza, J.: A Polynomial Algorithm to Compute the Concurrency Relation of Free-choice Signal Transition Graphs, Proc. Int. Workshop on Discrete Event Systems, IEE Society, 1996.

No context found.

A. Kovalyov, J. Esparza, A polynomial algorithm to compute the concurrency relation of free-choice Signal Transition Graphs, in: Proc. Intl. Workshop on Discrete Event Systems, 1996, pages. 1-6.

No context found.

A. Kovalyov and J. Esparza. A Polynomial Algorithm to Compute the Concurrency Relation of Free-choice Signal Transition Graphs. Proc. of the Int. Workshop on Discrete Event Systems, IEE, 1--6, 1996.

No context found.

A. Kovalyov and J. Esparza. A Polynomial Algorithm to Compute the Concurrency Relation of Free-choice Signal Transition Graphs. Proc. of the Int. Workshop on Discrete Event Systems, IEE, 1--6, 1996.

No context found.

A. Kovalyov and J. Esparza. A polynomial algorithm to compute the concurrency relation of free choice signal transition graphs. Technical Report TUM-I9528, Technische Universitat Munchen, 1995. 11

....O(b Delta m 3 ) where b is the bound of the net, i.e. the maximum number of tokens that a reachable marking can put in a place. More recently, 11] provided a structural characterization of the set of reachable markings which seemed to be an important step towards a polynomial algorithm, and [9] showed how to decide in O( n m) 3 ) time whether two given places can be simultaneously marked. Partially supported by the Sonderforschungsbereich 342, Teilprojekt A3. 1 Although some of the results valid for free choice Petri nets have been extended to slightly larger classes. 2 A ....

A. Kovalyov and J. Esparza. A polynomial algorithm to compute the concurrency relation of free choice signal transition graphs. Technical Report TUM-I9528, Technische Universitat Munchen, 1995.

No context found.

A. Kovalyov and J. Esparza. A polynomial algorithm to compute the concurrency relation of free-choice signal transition graphs. In Proceedings of the International Workshop on Discrete Event Syst ems, WODES'96, pages 1--6, August 1996.

No context found.

A. Kovalyov and J. Esparza. A polynomial algorithm to compute the concurrency relation of free-choice signal transition graphs. In Proceedings of the International Workshop on Discrete Event Syst ems, WODES'96, pages 1--6, August 1996.

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