1.+2. APN 1980, 1981: Bad Honnef, Germany / Strasbourg, France

Claude Girault, Wolfgang Reisig (Eds.): Application and Theory of Petri Nets, Selected Papers from the First and the Second European Workshop on Application and Theory of Petri Nets, Stasbourg 23.-26. September 1980, Bad Honnef 28.-30. September 1981. Informatik-Fachberichte 52 Springer 1982, ISBN 3-540-11189-1

Part One: First European Workshop on Application and Theory of Petri Nets

Application of Nets to Real-Time Systems

Gérard Roucairol: Overview. 1-2
Gérard Berthelot, Claude Girault, Gérard Roucairol: Petri Net Modelling and Reliability of Distributed Algorithms. 3-10
P. Rolin: Using Petri Nets in Measurements of a Distributed Data Base System. 11-22
Heinrich P. Godbersen: On the Problem of Time in Nets. 23-30

Programming Languages and Software Engineering

B. Cohen: Overview. 31
Eberhard Wegner: Transforming Nets Along the Syntactic Production of Programs. 32-37
Ernst Grill: Design-Review by Petri-Nets. 38-44
Raul Camposano: Concurrency in Functional Descriptions. 45-49
Wolfgang Rosenstiel: RNL - A Language for Digital Systems Design Based on Nets. 50-55
F. Vidono, I. López: Galileo: A Methodology for Modelling and Designing Real Time Systems. 56-63
Kurt Jensen, Morten Kyng: Petri Nets and Semantics of System Descriptions. 64-71

Information Flow and Concurrency

Eike Best: Overview. 72-73
Robert R. Johnson: The Relationship between Time and Information. 74-81
Eike Best: Information Flow in Nets. 82-87
Glynn Winskel: An Exercise in Processes with Infinite Pasts. 88-95
Ursula Goltz, Wolfgang Reisig, P. S. Thiagarajan: Two Alterative Definitions of Synchronic Distance. 96-103
Gert Scheschonk: On the Construction of System Nets. 104-108

Net Morphisms and Higher Level Net Interpretations

Wolfgang Reisig: Overview. 109-110
Dimitris Christodoulakis, Matthias Moritz: Net Morphisms and Software Engineering. 111-117
Engin Sirmen: An Equivalence-Notion for Condition/Event-Systems. 118-124
Wolfgang Reisig: Recursive Nets. 125-130
Charles André: Behaviour of a Place - Transition Net on a Subset of Transitions. 131-135
Ichiro Suzuki, Tadao Murata: Stepwise Refinements of Transitions and Places. 136-141
Wolfgang Hinderer: Transfer of Graph Constructs in Goguen's Paper to Net Constructs. 142-150
Dieter Gernert: Structural Modifications in Net Theory. 151-153

Mathematical Analysis and Net Languages

Otthein Herzog, Rüdiger Valk: Overview. 154-160
Jean-Pierre Queille, Joseph Sifakis: Iterative Methods for the Analysis of Petri Nets. 161-167
Horst Müller: Inductive Assertions for Analyzing Reachability Sets. 168-171
Gérard Memmi: Leakage Notion. 172-177
Otthein Herzog: Graph-Theoretical Analysis of a Subclass of Petri Nets. 178-182
Michael Yoeli: Synthesis of Concurrent Systems. 183-186
Bernd Heinemann: Subclasses of Self-Modifying Nets. 187-192
Rüdiger Valk: Test on Zero in Petri Nets. 193-197
Guy Vidal-Naquet: Deterministic Languages of Petri Nets. 198-202
Elöd Knuth, G. Györy, L. Rouyai: A Study of the Projection Operation. 203-207

Reliability and Recovery Issues

Robert Valette: Overview. 208-211
M. Morganti: Petri-Net Implementation of Recovery Strategies in a Large ESS. 212-221
Robert Valette: Petri Nets and Reliable Real Time Systems. 222-227
Jean-Michel Ayache, Pierre Azéma, Michel Diaz: Towards Fault Tolerant Real Time Systems by Using Petri Nets. 228-233
Wolfgang Hinderer: Treatment of Recovery Problems Using Cuts in Occurence Nets. 234-239

Part Two: Second European Workshop on Application and Theory of Petri Nets

Charles André: Use of the Behaviour Equivalence in Place-Transition Net Analysis. 241-250
Gérard Berthelot, Richard Terrat: Modeling and Proofs of a Data Transfer Protocol by Predicate/Transition Nets. 251-257
Giancarlo Mauri, M. Brambilla: On the Logic of Concurrency and Conflict. 258-268
Fiorella de Cindio, Giorgio De Michelis, Lucia Pomello, Carla Simone: Superposed Automata Nets. 269-279
Gerard Florin, Stéphane Natkin: Evaluation Based upon Stochastic Petri Nets of the Maximum Throughput of a Full Duplex Protocol. 280-288
Ursula Goltz, Wolfgang Reisig: Weighted Synchronic Distances. 289-300
J. Martinez, Manuel Silva: A Simple and Fast Algorithm to Obtain All Invariants of a Generalized Petri Net. 301-310
Pierangelo Miglioli, Ugo Moscato, Mario Ornaghi: Constructive Proofs as Programs Executable by PrT Nets. 311-322
Horst Müller: Correctness Proof for the Alternating Bit Protocol by Assertion Systems. 323-326
Anastasia Pagnoni: A Fair Competition Between Two or More Partners. 327-337

Last update Sat May 25 23:50:30 2013 CET by the DBLP Team —

Data released under the ODC-BY 1.0 license — See also our legal information page