J. Desel, G. Juh as, R. Lorenz. Process semantucs of Petri nets over partial algebra, Proc. ATPN, Aarhus (M. Nielsen, D. Simpson, eds.), LNCS 1825 (2000) 146-165.  Home/Search   Document Not in Database   Summary   Related Articles

....extended to tree languages (Doner, Thatcher and Wright) Our notion of automaton is a 1 safe Petri net [20] with A labelled transitions, a well known model which combines causality, concurrency and con ict. There is relatively little work on a language of terms describing the runs of a Petri net [26, 11, 23, 5], and the most popular approach has been to work with Mazurkiewicz traces [6] where concurrency is coded into the alphabet. In earlier work [16] one of us worked on series parallel terms (sp terms) which are de ned by adding to the concatenation product a parallel composition operation. The ....

....neighbourhoods. M 1 [uvi M 2 holds if there is an intermediate connected marking M such that M 1 [ui M and M [vi M 2 . Without the connectedness condition on intermediate markings, a run on abjjcd could also be seen as a run on (ajjc) bjjd) which are distinct poset behaviours. As opposed to [5], this means that parallel composition does not distribute over sequencing. This completes our de nition of the set of terms, given by the syntax u : a j u 1 u 2 j u 1 jju 2 , which we call sp terms. Note that there is no way of describing the empty poset. We have implicitly used the fact ....

J. Desel, G. Juh as, R. Lorenz. Process semantucs of Petri nets over partial algebra, Proc. ATPN, Aarhus (M. Nielsen, D. Simpson, eds.), LNCS 1825 (2000) 146-165.

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