Trace Nets

  • Eric Badouel
  • Philippe Darondeau
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 666)


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.


Trace Automata Regions Trace Nets 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [Bed88]
    Bednarczyk, M.A., Categories of asynchronous systems. PhD thesis, University of Sussex, report no.1/88 (1988).Google Scholar
  2. [DS84]
    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. [ER90]
    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. [NRT90]
    Nielsen, M., Rozenberg, G., and Thiagarajan, P.S., Elementary Transition Systems. DAIMI PB-310 Aarhus (1990).Google Scholar
  5. [NRT91]
    Nielsen, M., Rozenberg, G., and Thiagarajan, P.S., Transition Systems, Event Structures and Unfoldings. DAIMI PB-353 Aarhus (1991).Google Scholar
  6. [Sta89a]
    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. [Sta89b]
    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. [Win80]
    Winskel, G., Events in Computations. Ph.D thesis, University of Edinburgh, available as a Comp. Sc. report (1980).Google Scholar
  9. [Win91]
    Winskel, G., Categories of Models for Concurrency. Advanced School on the Algebraic, Logical, and Categorical Foundations of Concurrency, Gargnano del Garda (1991).Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1993

Authors and Affiliations

  • Eric Badouel
    • 1
  • Philippe Darondeau
    • 1
  1. 1.IRISA-INRIARennes CedexFrance

Personalised recommendations