Advances in Petri Nets 1984
Salvato in:
| Autore principale: | |
|---|---|
| Altri autori: | , |
| Natura: | Livre numérique |
| Lingua: | Anglais |
| Pubblicazione: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| Serie: | Lecture notes in computer science
188 |
| Soggetti: | |
| Accesso online: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Nota: |
Archives Springer e-books (Licence nationale) Archives Springer e-books (Licence nationale) |
| Autres localisations: | Voir dans le Sudoc |
| Edition sous un autre format: | • Advances in Petri nets 1984, ed. by G. Rozenberg, Berlin, Springer-Verlag, 1985, 1 vol. (VII-467 p.), Lecture notes in computer science, 3-540-15204-0 • Advances in Petri Nets 1984, Texte imprimé, 9783662196540 |
Sommario:
- PSI: A petri net based simulator for flexible manufacturing systems
- Modelling and validation of complex systems by coloured petri nets application to a flexible manufacturing system
- Concurrency axioms and D-continuous posets
- Frozen tokens and D-continuity: A study in relating system properties to process properties
- Modelling scheduling problems with timed petri nets
- Infinite behaviour and fairness in petri nets
- Petri net based models for the specification and validation of protocols
- A note on observable occurrence nets
- A lattice theoretic view of K-density
- Fair serializability of iterated transactions using fifo-nets
- Csp-programs as nets with individual tokens
- Design and programming of interfaces for monetic applications using petri nets
- Towards reachability trees for high-level petri nets
- The residue of vector sets with applications to decidability problems in petri nets
- The design of a program package for an introductory petri net course
- On communication protocol modelling and design
- On structural properties of generalized processes
- Stepwise construction of non-sequential software systems using a net-based specification language
- Liveness and duality in marked-graph-like predicate/transition nets
- Semantics of concurrent systems: A modular fixed-point trace approach
- The reachability problem for VAS
- K-density, N-density, and finiteness properties
- A net model of a local area network protocol
- In praise of free choice nets
- Computation of flows for unary-predicates/transitions-nets.