Garg, V. and Ragunath, M.T. (1992). Concurrent regular expressions and their relationship to Petri nets. Theoretical Computer Science, 96, 285-304.  Home/Search   Document Details and Download   Summary   Related Articles   Check

.... The concept of interaction systems presented here has evolved from a study of Mixed Network Algebras see, e.g. Ste98] GrSB98] GrLS00] Ste01] or the nal part of the recent book [Ste00] Our interaction systems may be seen as an extension of nite transition systems [Arn94] Petri nets [GaR92], or asynchronous automata [Zie87] in the sense that a potentially unbound number of processes may interact. In the mentioned models, while the number of processes may be unbounded, their interaction is bounded by the transitions breadth. This seems to be a key feature for the ability to pass ....

V. Garg and M.T. Ragunath. Concurrent regular expressions and their relationship to Petri nets. Theoretical Computer Science, 96:285-304, 1992.

.... computation 1 Introduction The operations shuffle and shuffle closure have been introduced to describe sequentialized execution histories of concurrent processes ( 11] 12] Together with other operations they describe various classes of languages which have been extensively studied (see [1], 2] 4] 5] 6] 7] 13] Here, we consider the class of shuffle languages which emerges from the class of finite languages through regular operations (union, concatenation, Kleene star) and shuffle operations (shuffle and shuffle closure) It was known that shuffle languages are properly ....

Garg, V. K and Ragunath, M. T. Concurrent regular expressions and their relationship to Petri nets, Theoret. Comput. Sci 96(1992), 285--304.

....partial words. A different idea is to enrich the alphabet with an independence relation to yield traces [15] It is quite common to reduce the study of poset languages to that of the usual word languages, by considering the set of linearizations of the posets in question (e.g. Garg and Ragunath [9]) In this paper, we deliberately choose to not follow this route and to operate on the posets themselves. This is made easier by the fact that we are working with sp posets and sp languages (sets of labelled sp posets) Indeed the set SP (A) of sp posets labelled by alphabet A can be seen as a ....

....on automata to characterize boundedwidth corresponds to 1 safe behaviour. We do not know of a characterization of the class of the sort of nets we are dealing with. As we mentioned earlier, we are not looking at Petri net languages as sets of words representing the behavior of a net (as in, say, [9]) Our approach follows that of Grabowski [12] retaining concurrency information at the language level. Grabowski characterizes 1safe Petri nets using poset (in his terminology, partial word ) languages, using a much richer syntax, including synchronization and renaming operations. The reader ....

V.K. Garg and M.T. Ragunath. Concurrent regular expressions and their relationship to Petri nets, Theoret. Comp. Sci. 96 (1992) 285--304.

....Although nets are well researched, the focus has been on examining causality, conflict and concurrency in their behaviour (see the book [15] for example. There have been a few attempts to study whether results such as the Kleene or Myhill Nerode theorems extend to Petri nets. Garg and Ragunath [7] obtained a Kleene theorem using concurrent rational expressions for all Petri net languages. Grabowski [10] also has a Kleene theorem using languages of (labelled) posets, which provide more information about concurrency. Boudol described rational parallel place machines and provided ....

V.K. Garg and M.T. Ragunath. Concurrent regular expressions and their relationship to Petri nets, Theoret. Comp. Sci. 96 (1992) 285--304.

No context found.

V. K. Garg, M.T. Raghunath "Concurrent Regular Expressions and their Relationship to Petri Net Languages," to appear Theoretical Computer Science Sept. 1991.

....greatest number of message pairs are reversed in a single reexecution. Alternatively, the programmer may specify an order expression which tells the possible sequences of events that are allowed. For example, she may use regular expression, its generalizations such as concurrent regular expressions[GR92], path expressions[CH74] or dag expressions[GTFR95] to specify these sequences. It is important to note here that once ordering of events has been changed, there is no guarantee that the rest of the computation will be the same as the last time. 4.5 Controlling Order Online Control We now ....

V. K. Garg and M. T. Raghunath. Concurrent regular expressions and their relationship to petri net languages. Theoretical Computer Science, 96:285--304, 1992.

No context found.

V. K. Garg, M.T. Raghunath "Concurrent Regular Expressions and their Relationship to Petri Net Languages," Theoretical Computer Science 96 (1992) pp 285-304.

....experience if the detection was carried out while the program was in execution. The user can then ask UTDDB whether any predicate expressed in a subset of the logic described in this paper ever became true. We are currently extending these algorithms for detection of sequences of global predicates [1,9,25], and relational global predicates [24] VII. Conclusions We have discussed detection of global predicates in a distributed program. Earlier algorithms for detection of global predicates proposed by Chandy and Lamport work only for stable predicates. Our algorithms detect even unstable ....

V. K. Garg and M.T. Raghunath, "Concurrent Regular Expressions and their Relationship to Petri Net Languages," Theoretical Computer Science 96 (1992) pp 285-304.

No context found.

Garg, V. and Ragunath, M.T. (1992). Concurrent regular expressions and their relationship to Petri nets. Theoretical Computer Science, 96, 285-304.

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