default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID4.+5. APN 1983, 1984: Toulouse/France, Aarhus/Denmark
- Grzegorz Rozenberg, Hartmann J. Genrich, Gérard Roucairol:
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. Lecture Notes in Computer Science 188, Springer 1985, ISBN 3-540-15204-0 - P. Alanche, K. Benzakour, F. Dollé, P. Gillet, P. Rodrigues, Robert Valette:
PSI: A Petri net based simulator for flexible manufacturing systems. 1-14 - Hassane Alla, P. Ladet, J. Martinez, M. Silva-Suarez:
Modelling and validation of complex systems by coloured Petri nets; Application to a flexible manufacturing system. 15-31 - Eike Best, Agathe Merceron:
Concurrency axioms and D-continuous posets. 32-47 - Eike Best, Agathe Merceron:
Frozen tokens and D-continuity: A study in relating system properties to process properties. 48-61 - J. Carlier, Philippe Chrétienne, Claude Girault:
Modelling scheduling problems with timed Petri nets. 62-82 - Heino Carstensen, Rüdiger Valk:
Infinite behaviour and fairness in Petri nets. 83-100 - Michel Diaz, Pierre Azéma:
Petri net based models for the specification and validation of protocols. 101-121 - César Fernández, Mogens Nielsen, P. S. Thiagarajan:
A note on observable occurrence nets. 122-138 - César Fernández, P. S. Thiagarajan:
A lattice theoretic view of K-density. 139-153 - Marie-Paule Flé, Gérard Roucairol:
Fair serializability of iterated transactions using FIFO-nets. 154-168 - Ursula Goltz, Wolfgang Reisig:
CSP-programs with individual tokens. 169-196 - Theodor Hildebrand:
Design and programming of interfaces for monetic applications using Petri nets. 197-214 - Peter Huber, Arne M. Jensen, Leif O. Jepsen, Kurt Jensen:
Towards reachability trees for high-level Petri nets. 215-233 - Rüdiger Valk, Matthias Jantzen:
The residue of vector sets with applications to decidability problems in Petri nets. 234-258 - Kurt Jensen:
The design of a program package for an introductory Petri net course. 259-266 - Guy Juanole, B. Algayres, J. Dufau:
On communication protocol modelling and design. 267-287 - Vadim E. Kotov, Ludmila Cherkasova:
On structural properties of generalized processes. 288-306 - Bernd J. Krämer
:
Stepwise construction of non-sequential software systems using a net-based specification language. 307-330 - Kurt Lautenbach, Anastasia Pagnoni:
Liveness and duality in marked-graph-like predicate/transition nets. 331-352 - Antoni W. Mazurkiewicz:
Semantics of concurrent systems: a modular fixed-point trace approach. 353-375 - Horst Müller:
The reachability problem for VAS. 376-391 - Helmut Plünnecke:
K-density, N-density and finiteness properties. 392-412 - Klaus Voss:
A net model of a local area network protocol. 413-437 - P. S. Thiagarajan, Klaus Voss:
In praise of free choice nets. 438-454 - Jacques Vautherin, Gérard Memmi:
Computation of flows for unary-predicates/transition-nets. 455-467
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-12-19 22:20 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
