Skip to main content
SpringerLink
Log in

Trace Channel Nets

  • Conference paper
  • First Online:
Application and Theory of Petri Nets 1999 (ICATPN 1999)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1639))

Included in the following conference series:

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 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

    Article  Google Scholar 

  2. Best. E, Devillers. R. Sequential and concurrent behaviour in Petri Nets theory. Theoretical Computer Science 55 (1987), 87–136.

    Article  MATH  MathSciNet  Google Scholar 

  3. Bracho. P, Droste. M, Kuske. D. Representation of computations in concurrent automata by dependence orders. Theoretical Computer Science 174 (1997) 67–96.

    Article  MATH  MathSciNet  Google Scholar 

  4. 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.

    Google Scholar 

  5. 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.

    Google Scholar 

  6. 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.

    Google Scholar 

  7. Cece. G, Finkel. A, Purushotaman. S.Unreliable channels are easier to verify than perfect channels. Information and computation, vol.124 (1),20–31,1996.

    Article  MATH  MathSciNet  Google Scholar 

  8. Droste. M. Recognizable languages in concurrency monoids. Theoretical Computer Science 150 (1995), 77–109.

    Article  MATH  MathSciNet  Google Scholar 

  9. 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.

    Google Scholar 

  10. Diekert. V, Gastin. P, Petit. A. Rational and recognizable complex trace languages. Information and Computation 116, 134–153, 1995.

    Article  MATH  MathSciNet  Google Scholar 

  11. 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.

    Google Scholar 

  12. Fanchon. J.Trace Channel Nets.LAAS report 98463,November 1998.

    Google Scholar 

  13. Fanchon. J, Boyer. M. Partial Order and Trace Channel Nets.LAAS report 98158, May 1998.

    Google Scholar 

  14. Finkel. A, Memmi. G. Fifo Nets: A New Model of Parallel Computation. Lecture Notes in Computer Science, Vol. 145: 111–121. Springer-Verlag, 1982.

    Google Scholar 

  15. 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.

    Article  MathSciNet  Google Scholar 

  16. Gischer. J. The equational theory of pomsets. Theoretical Computer Science 61 (1988) 199–224.

    Article  MathSciNet  MATH  Google Scholar 

  17. Grabowski. J. On partial Languages. Fundamenta Informaticae IV.2. (1981).

    Google Scholar 

  18. Jensen. K. Coloured Petri Nets. Monographs in Theoretical Computer Science. Springer Verlag, 1995.

    Google Scholar 

  19. Kiehn. A. Comparing locality and causality based equivalences. Acta Informatica 31, 697–718, 1994.

    Article  MATH  MathSciNet  Google Scholar 

  20. Kiehn. A. Observing Partial Order Runs of Petri Nets. Lecture Notes in Computer Science, Vol 1337, Foundations of Computer Science, Springer-Verlag 1998.

    Google Scholar 

  21. Lodaya. K, Weil. P. Series-parallel pomsets:Algebra, Automata and Languages. STACS 98, Lecture Notes in Computer Science, Vol. 1373, Springer-Verlag 1998.

    Chapter  Google Scholar 

  22. Mazurkiewicz. A. Basic notions of trace theory. Lecture Notes in Computer Science, Vol. 354: 285–363. Springer Verlag, 1989.

    Google Scholar 

  23. Nielsen. M, Sassone. V, Winskel. G.Relationships between models of concurrency. Lecture Notes in Computer Science, Vol. 803, 425–476. Springer-Verlag 1993.

    Google Scholar 

  24. Ochmanski. E. Regular behaviour of concurrent systems. Bulletin of the European Association for Theoretical Computer Science n.27 (1985),56–67.

    Google Scholar 

  25. Pratt. W. Modeling concurrency with partial orders. Int.J.Parallel Programming 15 (1987) 33–71.

    Article  MathSciNet  Google Scholar 

  26. Vogler. W. Modular Construction and Partial Order Semantics of Petri Nets. Lecture Notes in Computer Science, Vol. 625. Springer-Verlag, 1992

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. LAAS du CRNS, 7 av. du Col. Roche, 31077, Toulouse, France

    Jean Fanchon

Authors
  1. Jean Fanchon
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Dipartimento di Informatica, Università di Torino, C.so Svizzera 185, I-10149, Torino, Italy

    Susanna Donatelli

  2. LIACS, Leiden University , 2300 RA, Leiden, The Netherlands

    Jetty Kleijn

Rights and permissions

Reprints 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

Publish with us

Policies and ethics

Search

Navigation