Abstract
We present a new class of nets which includes and extends both Coloured Nets and Fifo Nets by defining weights on edges and markings of places as traces on a concurrent (trace) alphabet. Considering different independence relations on the alphabet, from the maximal one to the empty one (yielding words), Trace Channel Nets open a hierarchy of semantics on a single net structure. Furthermore a field of investigation results from the relationship between the independence on the alphabet and the behaviours of the net. In particular we show that the boundedness of a TCNet is related to particular independence relations, maximal w.r.t. boundedness, that TCNets can be applied to the study of Communicating Finite State Machines (using communication through a trace channel), and that they define a hierarchy of partial order semantics for Nets.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Amer. P, Chassot. C, Conolly. T. J,Diaz. M., Conrad. P. Partial-order transport service for multimedia and other applications. IEEE/ACM Transactions on Networking, Vol.2, N5, 440–456, October 1994
Best. E, Devillers. R. Sequential and concurrent behaviour in Petri Nets theory. Theoretical Computer Science 55 (1987), 87–136.
Bracho. P, Droste. M, Kuske. D. Representation of computations in concurrent automata by dependence orders. Theoretical Computer Science 174 (1997) 67–96.
Boudol. G, Castellani. I. On the semantics of concurrency:partial orders and transition systems. Lecture Notes in Computer Science, Vol. 249; CAAP 1987, 123–137. Springer-Verlag, 1987.
Benalycherif. M, Girault. C. Behavioural and Structural Composition Rules Preserving Liveness by Synchronisation for Coloured FiFo Nets. Lecture Notes in Computer Science, Vol 1091; ICATPN 96, 73–92. Springer-Verlag, 1996.
Chassot. C. DDiaz. M, Lozes. A. From the partial order concept to partial order multimedia connections. Journal of High Speed Networks, vol. 5, n. 2, 1996.
Cece. G, Finkel. A, Purushotaman. S.Unreliable channels are easier to verify than perfect channels. Information and computation, vol.124 (1),20–31,1996.
Droste. M. Recognizable languages in concurrency monoids. Theoretical Computer Science 150 (1995), 77–109.
Droste. M, Kuske. D. Automata with concurrency relations, a survey. Workshop on Algebraic and Syntactic Aspects of Concurrency.P. Gastin and A. Petit eds. LITP 95/48,1995.
Diekert. V, Gastin. P, Petit. A. Rational and recognizable complex trace languages. Information and Computation 116, 134–153, 1995.
Fanchon. J. A Fifo-net model for processes with asynchronous communication. Lecture Notes in Computer Science, Vol. 609; Advances in Petri Nets 1992, 152–178. Springer-Verlag, 1992.
Fanchon. J.Trace Channel Nets.LAAS report 98463,November 1998.
Fanchon. J, Boyer. M. Partial Order and Trace Channel Nets.LAAS report 98158, May 1998.
Finkel. A, Memmi. G. Fifo Nets: A New Model of Parallel Computation. Lecture Notes in Computer Science, Vol. 145: 111–121. Springer-Verlag, 1982.
Gastin. P, Petit. A, Zielonka. W. An extention of Kleene’s and Ochmanski’s theorems to infinite traces. Theoretical Computer Science 125 (1991), 167–204.
Gischer. J. The equational theory of pomsets. Theoretical Computer Science 61 (1988) 199–224.
Grabowski. J. On partial Languages. Fundamenta Informaticae IV.2. (1981).
Jensen. K. Coloured Petri Nets. Monographs in Theoretical Computer Science. Springer Verlag, 1995.
Kiehn. A. Comparing locality and causality based equivalences. Acta Informatica 31, 697–718, 1994.
Kiehn. A. Observing Partial Order Runs of Petri Nets. Lecture Notes in Computer Science, Vol 1337, Foundations of Computer Science, Springer-Verlag 1998.
Lodaya. K, Weil. P. Series-parallel pomsets:Algebra, Automata and Languages. STACS 98, Lecture Notes in Computer Science, Vol. 1373, Springer-Verlag 1998.
Mazurkiewicz. A. Basic notions of trace theory. Lecture Notes in Computer Science, Vol. 354: 285–363. Springer Verlag, 1989.
Nielsen. M, Sassone. V, Winskel. G.Relationships between models of concurrency. Lecture Notes in Computer Science, Vol. 803, 425–476. Springer-Verlag 1993.
Ochmanski. E. Regular behaviour of concurrent systems. Bulletin of the European Association for Theoretical Computer Science n.27 (1985),56–67.
Pratt. W. Modeling concurrency with partial orders. Int.J.Parallel Programming 15 (1987) 33–71.
Vogler. W. Modular Construction and Partial Order Semantics of Petri Nets. Lecture Notes in Computer Science, Vol. 625. Springer-Verlag, 1992
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Fanchon, J. (1999). Trace Channel Nets. In: Donatelli, S., Kleijn, J. (eds) Application and Theory of Petri Nets 1999. ICATPN 1999. Lecture Notes in Computer Science, vol 1639. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48745-X_19
Download citation
DOI: https://doi.org/10.1007/3-540-48745-X_19
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66132-0
Online ISBN: 978-3-540-48745-6
eBook Packages: Springer Book Archive