4.+5. APN 1983, 1984: Toulouse/France, Aarhus/Denmark

@proceedings{DBLP:conf/apn/1984,
  editor    = {Grzegorz Rozenberg and
               Hartmann J. Genrich and
               G{\'e}rard Roucairol},
  title     = {Advances in Petri Nets 1984, European Workshop on Applications
               and Theory in Petri Nets, covers the last two years which include
               the workshop 1983 in Toulouse and the workshop 1984 in Aarhus,
               selected papers},
  booktitle = {European Workshop on Applications and Theory in Petri Nets},
  publisher = {Springer},
  series    = {Lecture Notes in Computer Science},
  volume    = {188},
  year      = {1985},
  isbn      = {3-540-15204-0},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

• P. Alanche, K. Benzakour, F. Dollé, P. Gillet, P. Rodrigues, Robert Valette: PSI: A Petri net based simulator for flexible manufacturing systems. 1-14 BibTeX
• Hassane Alla, P. Ladet, J. Martinez, M. Silva-Suarez: Modelling and validation of complex systems by coloured Petri nets; Application to a flexible manufacturing sytem. 15-31 BibTeX
• Eike Best, Agathe Merceron: Concurrency axioms and D-continuous posets. 32-47 BibTeX
• Eike Best, Agathe Merceron: Frozen tokens and D-continuity: A study in relating system properties to process properties. 48-61 BibTeX
• J. Carlier, Philippe Chrétienne, Claude Girault: Modelling scheduling problems with timed Petri nets. 62-82 BibTeX
• Heino Carstensen, Rüdiger Valk: Infinite behaviour and fairness in Petri nets. 83-100 BibTeX
• Michel Diaz, Pierre Azéma: Petri net based models for the specification and validation of protocols. 101-121 BibTeX
• César Fernández, Mogens Nielsen, P. S. Thiagarajan: A note on observable occurrence nets. 122-138 BibTeX
• César Fernández, P. S. Thiagarajan: A lattice theoretic view of K-density. 139-153 BibTeX
• Marie-Paule Flé, Gérard Roucairol: Fair serializability of iterated transactions using FIFO-nets. 154-168 BibTeX
• Ursula Goltz, Wolfgang Reisig: CSP-programs with individual tokens. 169-196 BibTeX
• Theodor Hildebrand: Design and programming of interfaces for monetic applications using Petri nets. 197-214 BibTeX
• Peter Huber, Arne M. Jensen, Leif O. Jepsen, Kurt Jensen: Towards reachability trees for high-level Petri nets. 215-233 BibTeX
• Rüdiger Valk, Matthias Jantzen: The residue of vector sets with applications to decidability problems in Petri nets. 234-258 BibTeX
• Kurt Jensen: The design of a program package for an introductory Petri net course. 259-266 BibTeX
• Guy Juanole, B. Algayres, J. Dufau: On communication protocol modelling and design. 267-287 BibTeX
• Vadim E. Kotov, Ludmila Cherkasova: On structural properties of generalized processes. 288-306 BibTeX
• Bernd J. Krämer: Stepwise construction of non-sequential software systems using a net-based specification language. 307-330 BibTeX
• Kurt Lautenbach, Anastasia Pagnoni: Liveness and duality in marked-graph-like predicate/transition nets. 331-352 BibTeX
• Antoni W. Mazurkiewicz: Semantics of concurrent systems: a modular fixed-point trace approach. 353-375 BibTeX
• Horst Müller: The reachability problem for VAS. 376-391 BibTeX
• Helmut Plünnecke: K-density, N-density and finiteness properties. 392-412 BibTeX
• Klaus Voss: A net model of a local area network protocol. 413-437 BibTeX
• P. S. Thiagarajan, Klaus Voss: In praise of free choice nets. 438-454 BibTeX
• Jacques Vautherin, Gérard Memmi: Computation of flows for unary-predicates/transition-nets. 455-467 BibTeX