Advances in Petri Nets 1984

AvG. Rozenberg

Häftad, Engelska, 1985

Del i serien Lecture Notes in Computer Science

530 kr

Beställningsvara. Skickas inom 10-15 vardagar. Fri frakt över 249 kr.

Produktinformation

Utgivningsdatum:1985-03-01
Mått:155 x 235 x 26 mm
Vikt:721 g
Format:Häftad
Språk:Engelska
Serie:Lecture Notes in Computer Science
Antal sidor:472
Upplaga:1985
Förlag:Springer-Verlag Berlin and Heidelberg GmbH & Co. KG
ISBN:9783540152040

Utforska kategorier

Programvaruutveckling inom Data och IT
Hårdvara inom Data och IT

Innehållsförteckning

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.