Cantitate/Preț
Produs

Coloured Petri Nets: Basic Concepts, Analysis Methods and Practical Use. Volume 2: Monographs in Theoretical Computer Science. An EATCS Series

Autor Kurt Jensen
en Limba Engleză Hardback – 28 noi 1994
This three-volume work presents a coherent description of the theoretical and practical aspects of coloured Petri nets (CP-nets). The second volume contains a detailed presentation of the analysis methods for CP-nets. They allow the modeller to investigate dynamic properties of CP-nets.
The main ideas behind the analysis methods are described as well as the mathematics on which they are based and also how the methods are supported by computer tools. Some parts of the volume are theoretical while others are application oriented. The purpose of the volume is to teach the reader how to use the formal analysis methods, which does not require a deep understanding of the underlying mathematical theory.
Citește tot Restrânge

Toate formatele și edițiile

Toate formatele și edițiile Preț Express
Paperback (3) 60736 lei  6-8 săpt.
  Springer – dec 2010 60736 lei  6-8 săpt.
  Springer – 16 sep 2011 61760 lei  6-8 săpt.
  Springer – 19 oct 2010 88247 lei  6-8 săpt.
Hardback (2) 62181 lei  6-8 săpt.
  Springer Berlin, Heidelberg – 28 noi 1994 62181 lei  6-8 săpt.
  Springer Berlin, Heidelberg – 25 mar 1996 89793 lei  6-8 săpt.

Din seria Monographs in Theoretical Computer Science. An EATCS Series

Preț: 62181 lei

Preț vechi: 77727 lei
-20%

Puncte Express: 933

Preț estimativ în valută:
10997 12709$ 9491£

Carte tipărită la comandă

Livrare economică 25 aprilie-09 mai


Specificații

ISBN-13: 9783540582762
ISBN-10: 3540582762
Pagini: 196
Ilustrații: X, 177 p.
Dimensiuni: 155 x 235 x 16 mm
Greutate: 0.45 kg
Ediția:1995
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seria Monographs in Theoretical Computer Science. An EATCS Series

Locul publicării:Berlin, Heidelberg, Germany

Public țintă

Research

Cuprins

Contents Overview: Full Occurrence Graphs.- Occurrence Graphs with Equivalence Classes.- Occurrence Graphs with Symmetries.- Invariants.- Timed CP-nets.- References.- Index.