P.W. Hoogers, H.C.M. Kleijn, and P.S. Thiagarajan (1992), A Trace Semantics for Petri Nets, in Proceedings of ICALP 92, W. Kuich (Ed.), Lecture Notes in Computer Science 623, 595--604, Springer-Verlag.  Home/Search   Document Not in Database   Summary   Related Articles   Check

.... them, we recall [Pra91] where, in order to obtain a model mathematically more attractive than Petri nets , a geometric model of concurrency based on n categories as models of higher dimensional automata is introduced, but the modelling power obtained is not greater than that of ordinary PT nets; [HKT92], in which the authors give semantics to PT nets in terms of generalized trace languages and discuss how using their work it could perhaps be possible to obtain a concept of unfolding for PT nets; and [Eng91] where the unfolding of Petri nets is given in term of a branching process. However, the ....

P.W. Hoogers, H.C.M. Kleijn, and P.S. Thiagarajan. A Trace Semantics for Petri Nets. To appear in proceedings of ICALP `92, 1992.

....appeared, in symbols a 6 I a b. In particular, we shall present a category GTL of generalized trace languages which is equivalent to the category dLES of deterministic labelled event structures. We remark that a similar idea of generalizing Mazurkiewicz trace languages has been considered also in [6]. Summing up, Section 4 presents the chain of equivalences dSL = dLES = GTL which, besides identifying models which can replace dLES in our classification, also introduce interesting deterministic behavioural models for concurrency and formalizes their mutual relationships. Here most of ....

P.W. Hoogers, H.C.M Kleijn, and P.S. Thiagarajan. A Trace Semantics for Petri Nets. In Proceedings of ICALP `92, LNCS, n. 623, pp. 595--604, Springer Verlag, 1992.

....appeared, in symbols a 6 I a b. In particular, we shall present a category GTL of generalized trace languages which is equivalent to the category dLES of deterministic labelled event structures. We remark that a similar idea of generalizing Mazurkiewicz trace languages has been considered also in [4]. Summing up, we present the chain of equivalences dSL dLES GTL which, besides identifying models which can replace dLES in our classification, also introduce interesting deterministic behavioural models for concurrency and formalizes their mutual relationships. This being an extended ....

P.W. Hoogers, H.C.M Kleijn, and P.S. Thiagarajan. A Trace Semantics for Petri Nets. In Proceedings of ICALP `92, LNCS, n. 623, pp. 595--604, Springer Verlag, 1992.

....the requirements of [NRT92] and shows that for each transition system TS satisfying the weaker requirements there exists an elementary net whose reachability graph is bisimilar to TS. For nets or transition systems (without internal events) bisimilarity and language equivalence coincide; based on [HKT92], language equivalent realization of transition systems is studied in [BBD95] for bounded nets and in [Dar98] for unbounded nets. Finally, Yak98] is confronted with a transition system that cannot be realized by a net in any of these approaches; since the reaction to such a situation can hardly ....

....show that a semisafe ATS A can be realized by a visible net up to bisimilarity by transforming A to a bisimilar safe ATS and applying the above theorem. Semi safety on languages, i.e. on infinite tree shaped transition systems is also considered in [BBD95] and in the context of trace languages in [HKT92]. We note a lemma first. Lemma 5.5 Let A be a visible ATS, B an equivalence on Q that is also a bisimulation on A, and denote the equivalence class of q 2 Q by [q] Then the B quotient A 0 = f[q] j q 2 Qg; E v ; T 0 ; q 0 ] I) is a (visible) ATS bisimilar to A, where T 0 ( q] a) ....

[Article contains additional citation context not shown here]

P. Hoogers, H. Kleijn, and P.S. Thiagarajan. A trace semantics for Petri nets. In W. Kuich, editor, Automata, Languages and Programming, ICALP 1992, Lect. Notes Comp. Sci. 623, 595--604. Springer, 1992.

....We aim to obtain a semantics for CSP like languages capable of making concurrency distinctions as in Mazurkiewicz trace theory, while, at the same time, capable of handling non determinism and deadlock in the process algebra style. An extension of trace theory to cater for Petri nets appeared in [13]. We propose a new framework of refinements of the classical, failures semantics with relations on traces capturing the notions of possible, and their duals, guaranteed , relations of concurrency, conflict and causality. These relations are defined by induction over syntax of CSP processes. We ....

P.W. Hoogers, H. Kleijn, and P.S. Thiagarajan. A trace semantics for petri nets. In ICALP'92, volume 623 of Lecture Notes in Computer Science. Springer-Verlag, 1992.

.... as models of higher dimensional automata is introduced, but the modelling power obtained does not seem to be greater than that of ordinary PT nets, though the framework is highly elegantly linked to algebraic topology (Goubault and Jensen 1992; Goubault 1993; see also Cattani and Sassone 1996) (Hoogers et al. 1992), in which the authors give semantics to PT nets in terms of generalized trace languages and discuss how using their work it could perhaps be possible to obtain a concept of unfolding for PT nets; and (Engelfriet 1991) where the unfolding of Petri nets is given in term of a branching process. ....

....cannot be handled properly by trace languages. On the other hand, it is equally clear that one can build such a trace language by choosing appropriately the underlying alphabet. However, it seems that a satisfactory solution to this issue has to deal with a generalization of trace languages, e.g. (Hoogers et al. 1992; Sassone et al. 1993b) The adjunction between PTNets and Occ factorizes through two adjunctions involving a category of decorated occurrence nets, DecOcc. Although this factorization may at first seem to be just a convenient technical solution, there in fact are some insights on the semantics ....

Hoogers, P.W., Kleijn, H.C.M. and Thiagarajan, P.S. (1992) A Trace Semantics for Petri Nets. In Proceedings of ICALP 92, Lecture Notes in Computer Science 623, 595--604, Springer-Verlag.

....We aim to obtain a semantics for CSP like languages capable of making concurrency distinctions as in Mazurkiewicz trace theory, while, at the same time, capable of handling non determinism and deadlock in the process algebra style. An extension of trace theory to cater for Petri nets appeared in [11]. We propose a new framework of refinements of the classical, failures semantics with relations on traces capturing the notions of possible, and their duals, guaranteed , relations of concurrency, conflict and causality. These relations are defined by induction over syntax of CSP processes. We ....

P.W. Hoogers, H. Kleijn, and P.S. Thiagarajan. A trace semantics for petri nets. In ICALP'92, volume 623 of Lecture Notes in Computer Science. Springer-Verlag, 1992.

....and conflict could mean. Fortunately, there is a fairly well understood construction, the so called regional construction, by which one can manufacture places (of a Petri net) out of concurrency models which have a natural transition relation associated with them. See, e.g. ER] NRT] WN] [HKT1], M] Definition 4.1 Let ES = E; C; be an L event structure. A region of ES is a function r : C [ E N [ N Theta N) satisfying the following conditions. 1) 8c 2 C: r(c) 2 N and 8e 2 E: r(e) 2 N Theta N. For e 2 E we write r(e) r e; e r ) 2) c u ) r(c) P e2u r e and ....

Hoogers, P.W., Kleijn, H.C.M., and Thiagarajan, P.S., (1992), A trace semantics for Petri nets, Lecture Notes in Computer Science 623, 595-604.

No context found.

P.W. Hoogers, H.C.M. Kleijn, and P.S. Thiagarajan (1992), A Trace Semantics for Petri Nets, in Proceedings of ICALP 92, W. Kuich (Ed.), Lecture Notes in Computer Science 623, 595--604, Springer-Verlag.

No context found.

P.W. Hoogers, H.C.M. Kleijn, and P.S. Thiagarajan (1992), A Trace Semantics for Petri Nets, in Proceedings of ICALP 92, W. Kuich (Ed.), Lecture Notes in Computer Science 623, 595--604, Springer-Verlag.

No context found.

Hoogers, P.W., Kleijn, H.C.M., and Thiagarajan, P.S., A Trace Semantics for Petri Nets. Proceedings of ICALP'92, Lecture Notes in Computer Science vol. 623 (1992) 595-604.

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