Skip to main content
SpringerLink
Log in
Book cover

Workshop/School/Symposium of the REX Project (Research and Education in Concurrent Systems)

REX 1992: Semantics: Foundations and Applications pp 21–50Cite as

Trace Nets

  • Conference paper
  • First Online:

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

Abstract

Trace Nets are a variant of one-safe Petri Nets, where input and output places may be filled as well as emptied by transitions. Those extended nets have been introduced by the authors for modelling concurrency in a simple format of structural operational specifications, based on permutation of proved transitions. Trace Nets are connected by an adjunction to a particular class of Trace Automata in the sense of Stark, namely the Separated Trace Automata. The adjunction is based on a calculus of ’regions’ that differ significantly from the ones devised by Ehrenfeucht and Rozenberg for Elementary Nets, although the axioms of separation are the same.

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bednarczyk, M.A., Categories of asynchronous systems. PhD thesis, University of Sussex, report no.1/88 (1988).

    Google Scholar 

  2. De Simone, R., Calculabilité et expressivité dans l'algèbre de processus parallèles Meije. Thèse de 3eme cycle, Université de Paris VII (1984).

    Google Scholar 

  3. Ehrenfeucht, A., and Rozenberg, G., Partial 2-structures; Part I: Basic Notions and the Representation Problem, and Part II: State Spaces of Concurrent Systems, Acta Informatica, vol 27 (1990).

    Google Scholar 

  4. Nielsen, M., Rozenberg, G., and Thiagarajan, P.S., Elementary Transition Systems. DAIMI PB-310 Aarhus (1990).

    Google Scholar 

  5. Nielsen, M., Rozenberg, G., and Thiagarajan, P.S., Transition Systems, Event Structures and Unfoldings. DAIMI PB-353 Aarhus (1991).

    Google Scholar 

  6. Stark, E.W., Connections between a Concrete and an Abstract Model of Concurrent Systems. 5th Mathematical Foundations of Programming Semantics (1989) 53–79.

    Google Scholar 

  7. Stark, E.W., Compositional Relational Semantics for Indeterminate Dataflow Networks. Summer Conference on Category Theory and Computer Science, LNCS 389 (1989) 52–74.

    Google Scholar 

  8. Winskel, G., Events in Computations. Ph.D thesis, University of Edinburgh, available as a Comp. Sc. report (1980).

    Google Scholar 

  9. Winskel, G., Categories of Models for Concurrency. Advanced School on the Algebraic, Logical, and Categorical Foundations of Concurrency, Gargnano del Garda (1991).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. IRISA-INRIA, Campus de Beaulieu, F-35042, Rennes Cedex, France

    Eric Badouel & Philippe Darondeau

Authors
  1. Eric Badouel
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Philippe Darondeau
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

J. W. de Bakker W. -P. de Roever G. Rozenberg

Rights and permissions

Reprints and permissions

Copyright information

© 1993 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Badouel, E., Darondeau, P. (1993). Trace Nets. In: de Bakker, J.W., de Roever, W.P., Rozenberg, G. (eds) Semantics: Foundations and Applications. REX 1992. Lecture Notes in Computer Science, vol 666. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-56596-5_27

Download citation

  • DOI: https://doi.org/10.1007/3-540-56596-5_27

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-56596-3

  • Online ISBN: 978-3-540-47595-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation