| |
|
|
|
|
|
|
|
|
1. |
Record Nr. |
UNISA996466103403316 |
|
|
Titolo |
Advances in Petri Nets 1984 [[electronic resource] /] / edited by G. Rozenberg |
|
|
|
|
|
|
|
Pubbl/distr/stampa |
|
|
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1985 |
|
|
|
|
|
|
|
|
|
ISBN |
|
|
|
|
|
|
Edizione |
[1st ed. 1985.] |
|
|
|
|
|
Descrizione fisica |
|
1 online resource (XII, 472 p.) |
|
|
|
|
|
|
Collana |
|
Lecture Notes in Computer Science, , 0302-9743 ; ; 188 |
|
|
|
|
|
|
Disciplina |
|
|
|
|
|
|
Soggetti |
|
Software engineering |
Computer communication systems |
Software Engineering |
Computer Communication Networks |
|
|
|
|
|
|
|
|
Lingua di pubblicazione |
|
|
|
|
|
|
Formato |
Materiale a stampa |
|
|
|
|
|
Livello bibliografico |
Monografia |
|
|
|
|
|
Note generali |
|
Bibliographic Level Mode of Issuance: Monograph |
|
|
|
|
|
|
Nota di contenuto |
|
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. |
|
|
|
|
|
| |