Dualities between nets and automata induced by schizophrenic objects

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


The so-called synthesis problem for nets, which consists in deciding whether a given graph is isomorphic to the case graph of some net, and then constructing the net, has been solved in the litterature for various types of nets, ranging from elementary nets to Petri nets. The common principle for the synthesis is the idea of regions in graphs, representing possible extensions of places in nets. When the synthesis problem has a solution, the set of regions viewed as properties of states provides a set-theoretic representation of the transition system. We show that such correspondences between nets and transition systems can be described as dualities induced by schizophrenic objects, leading further the analogy with classical representation theorems and giving us a means to describe uniformly previously known translations between nets and automata.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [AN82]
    Arnold, A., and Nivat, M., Comportements de processus. Colloque AFCET « Les Mathématiques de l'Informatique », (1982) 35–68.Google Scholar
  2. [BD93]
    Badouel, E., and Darondeau, Ph., Trace Nets. REX workshop, Beekbergen “Semantics: Foundation and Applications”, Springer-Verlag Lecture Notes in Computer Science, vol. 666 (1993) 21–50.Google Scholar
  3. [BDP93]
    Bernardinello, L., De Michelis, G., and Petruni, K., Synchronic distances as Generalized Regions. Rapporto Interno n. 107-93, Dipartimento di Scienze dell'Informazione, Universitá degli Studi di Milano (1993).Google Scholar
  4. [DS93]
    Droste, M., and Shortt, R.M., Petri Nets and Automata with Concurrency Relations — an Adjunction, in ”Semantics of Programming Languages and Model Theory”, M. Droste and Y. Gurevich eds(1993) 69–87.Google Scholar
  5. [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
  6. [Isb72]
    Isbell, J. R., General Functorial Semantics, I., American Journal of Mathematics, vol 94 (1972) 535–596.Google Scholar
  7. [Joh82]
    Johnstone, P.T., Stone Spaces. Cambridge University Press, (1982).Google Scholar
  8. [Muk93]
    Mukund, M., Petri Nets and Step Transition Systems. International Journal of Foundation of Computer Science, vol 3, nℴ 3 (1993).Google Scholar
  9. [PT91]
    Porst, H.-E., and Tholen, W., Concrete Dualities. In “Category Theory at Work”, H. Herrlich, and H.-E. Porst (eds.), Heldermann Verlag Berlin (1991) 111–136.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1995

Authors and Affiliations

  • Eric Badouel
    • 1
  • Philippe Darondeau
    • 1
  1. 1.IrisaRennes CedexFrance

Personalised recommendations