Artículos relacionados a Time and Petri Nets

Time and Petri Nets - Tapa dura

 
9783642411144: Time and Petri Nets
Ver todas las copias de esta edición ISBN.
 
 
<P>AT FIRST GLANCE THE CONCEPTS OF TIME AND OF PETRI NETS ARE QUITE CONTRARY: WHILE TIME DETERMINES THE OCCURRENCES OF EVENTS IN A SYSTEM, CLASSIC PETRI NETS CONSIDER THEIR CAUSAL RELATIONSHIPS AND THEY REPRESENT EVENTS AS CONCURRENT SYSTEMS. BUT IF WE TAKE A CLOSER LOOK AT HOW TIME AND CAUSALITY ARE INTERTWINED WE REALIZE THAT THERE ARE MANY POSSIBLE WAYS IN WHICH TIME AND PETRI NETS INTERACT. THIS BOOK TAKES A CLOSER LOOK AT THREE TIME-DEPENDENT PETRI NETS: TIME PETRI NETS, TIMED PETRI NETS, AND PETRI NETS WITH TIME WINDOWS.</P><P>THE AUTHOR FIRST EXPLAINS CLASSIC PETRI NETS AND THEIR FUNDAMENTAL PROPERTIES. THEN THE PIVOTAL CONTRIBUTION OF THE BOOK IS THE INTRODUCTION OF DIFFERENT ALGORITHMS THAT ALLOW US TO ANALYZE TIME-DEPENDENT PETRI NETS. FOR TIME PETRI NETS, THE AUTHOR PRESENTS AN ALGORITHM THAT PROVES THE BEHAVIORAL EQUIVALENCE OF A NET WHERE TIME IS DESIGNED ONCE WITH REAL AND ONCE WITH NATURAL NUMBERS, SO WE CAN REDUCE THE STATE SPACE AND CONSIDER THE INTEGER STATES EXCLUSIVELY. FOR TIMED PETRI NETS, THE AUTHOR INTRODUCES TWO TIME-DEPENDENT STATE EQUATIONS, PROVIDING A SUFFICIENT CONDITION FOR THE NON-REACHABILITY OF STATES, AND SHE ALSO DEFINES A LOCAL TRANSFORMATION FOR CONVERTING THESE NETS INTO TIME PETRI NETS. FINALLY, SHE SHOWS THAT PETRI NETS WITH TIME-WINDOWS HAVE THE ABILITY TO REALIZE EVERY TRANSITION SEQUENCE FIRED IN THE NET OMITTING TIME RESTRICTIONS.</P><P>THESE CLASSES OF TIME-DEPENDENT PETRI NETS SHOW THAT TIME ALONE DOES NOT CHANGE THE POWER OF A PETRI NET, IN FACT TIME MAY OR MAY NOT BE USED TO FORCE FIRING. FOR TIME PETRI NETS AND TIMED PETRI NETS WE CAN SAY THAT THEY ARE TURING-POWERFUL, AND THUS MORE POWERFUL THAN CLASSIC PETRI NETS, BECAUSE THERE IS A COMPULSION TO FIRE AT SOME POINT IN TIME. BY CONTRAST, PETRI NETS WITH TIME-WINDOWS HAVE NO COMPULSION TO FIRE, THEIR EXPRESSIVENESS POWER IS LESS THAN THAT OF TURING-MACHINES.</P><P>THIS BOOK DERIVES FROM ADVANCED LECTURES, AND THE TE

"Sinopsis" puede pertenecer a otra edición de este libro.

Reseña del editor:

At first glance the concepts of time and of Petri nets are quite contrary: while time determines the occurrences of events in a system, classic Petri nets consider their causal relationships and they represent events as concurrent systems. But if we take a closer look at how time and causality are intertwined we realize that there are many possible ways in which time and Petri nets interact. This book takes a closer look at three time-dependent Petri nets: Time Petri nets, Timed Petri nets, and Petri nets with time windows.

The author first explains classic Petri nets and their fundamental properties. Then the pivotal contribution of the book is the introduction of different algorithms that allow us to analyze time-dependent Petri nets. For Time Petri nets, the author presents an algorithm that proves the behavioral equivalence of a net where time is designed once with real and once with natural numbers, so we can reduce the state space and consider the integer states exclusively. For Timed Petri nets, the author introduces two time-dependent state equations, providing a sufficient condition for the non-reachability of states, and she also defines a local transformation for converting these nets into Time Petri nets. Finally, she shows that Petri nets with time-windows have the ability to realize every transition sequence fired in the net omitting time restrictions.

These classes of time-dependent Petri nets show that time alone does not change the power of a Petri net, in fact time may or may not be used to force firing. For Time Petri nets and Timed Petri nets we can say that they are Turing-powerful, and thus more powerful than classic Petri nets, because there is a compulsion to fire at some point in time. By contrast, Petri nets with time-windows have no compulsion to fire, their expressiveness power is less than that of Turing-machines.

This book derives from advanced lectures, and the text is supported throughout with examples and exercises. It is suitable for graduate courses in computer science, mathematics, engineering, and related disciplines, and as a reference for researchers. 

"Sobre este título" puede pertenecer a otra edición de este libro.

  • EditorialSpringer
  • Año de publicación2013
  • ISBN 10 3642411142
  • ISBN 13 9783642411144
  • EncuadernaciónTapa dura
  • Número de páginas224

Comprar nuevo

Ver este artículo

Gastos de envío: GRATIS
A Estados Unidos de America

Destinos, gastos y plazos de envío

Añadir al carrito

Otras ediciones populares con el mismo título

9783662514351: Time and Petri Nets

Edición Destacada

ISBN 10:  3662514354 ISBN 13:  9783662514351
Editorial: Springer, 2016
Tapa blanda

  • 9783642411168: Time and Petri Nets

    Springer, 2013
    Tapa blanda

Los mejores resultados en AbeBooks

Imagen del vendedor

Popova-Zeugmann, Louchka
Publicado por Springer (2013)
ISBN 10: 3642411142 ISBN 13: 9783642411144
Nuevo Tapa dura Cantidad disponible: 10
Librería:
booksXpress
(Bayonne, NJ, Estados Unidos de America)

Descripción Hardcover. Condición: new. Nº de ref. del artículo: 9783642411144

Más información sobre este vendedor | Contactar al vendedor

Comprar nuevo
EUR 52,77
Convertir moneda

Añadir al carrito

Gastos de envío: GRATIS
A Estados Unidos de America
Destinos, gastos y plazos de envío
Imagen de archivo

Louchka Popova-Zeugmann
Publicado por Springer (2013)
ISBN 10: 3642411142 ISBN 13: 9783642411144
Nuevo Tapa dura Cantidad disponible: > 20
Impresión bajo demanda
Librería:
Ria Christie Collections
(Uxbridge, Reino Unido)

Descripción Condición: New. PRINT ON DEMAND Book; New; Fast Shipping from the UK. No. book. Nº de ref. del artículo: ria9783642411144_lsuk

Más información sobre este vendedor | Contactar al vendedor

Comprar nuevo
EUR 58,69
Convertir moneda

Añadir al carrito

Gastos de envío: EUR 11,61
De Reino Unido a Estados Unidos de America
Destinos, gastos y plazos de envío
Imagen del vendedor

Louchka Popova-Zeugmann
ISBN 10: 3642411142 ISBN 13: 9783642411144
Nuevo Tapa dura Cantidad disponible: 2
Impresión bajo demanda
Librería:
BuchWeltWeit Ludwig Meier e.K.
(Bergisch Gladbach, Alemania)

Descripción Buch. Condición: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -At first glance the concepts of time and of Petri nets are quite contrary: while time determines the occurrences of events in a system, classic Petri nets consider their causal relationships and they represent events as concurrent systems. But if we take a closer look at how time and causality are intertwined we realize that there are many possible ways in which time and Petri nets interact. This book takes a closer look at three time-dependent Petri nets: Time Petri nets, Timed Petri nets, and Petri nets with time windows.The author first explains classic Petri nets and their fundamental properties. Then the pivotal contribution of the book is the introduction of different algorithms that allow us to analyze time-dependent Petri nets. For Time Petri nets, the author presents an algorithm that proves the behavioral equivalence of a net where time is designed once with real and once with natural numbers, so we can reduce the state space and consider the integer states exclusively. For Timed Petri nets, the author introduces two time-dependent state equations, providing a sufficient condition for the non-reachability of states, and she also defines a local transformation for converting these nets into Time Petri nets. Finally, she shows that Petri nets with time-windows have the ability to realize every transition sequence fired in the net omitting time restrictions.These classes of time-dependent Petri nets show that time alone does not change the power of a Petri net, in fact time may or may not be used to force firing. For Time Petri nets and Timed Petri nets we can say that they are Turing-powerful, and thus more powerful than classic Petri nets, because there is a compulsion to fire at some point in time. By contrast, Petri nets with time-windows have no compulsion to fire, their expressiveness power is less than that of Turing-machines.This book derives from advanced lectures, and the text is supported throughout with examples and exercises. It is suitable for graduate courses in computer science, mathematics, engineering, and related disciplines, and as a reference for researchers. 224 pp. Englisch. Nº de ref. del artículo: 9783642411144

Más información sobre este vendedor | Contactar al vendedor

Comprar nuevo
EUR 53,49
Convertir moneda

Añadir al carrito

Gastos de envío: EUR 23,00
De Alemania a Estados Unidos de America
Destinos, gastos y plazos de envío
Imagen del vendedor

Louchka Popova-Zeugmann
Publicado por Springer Berlin Heidelberg (2013)
ISBN 10: 3642411142 ISBN 13: 9783642411144
Nuevo Tapa dura Cantidad disponible: 1
Librería:
AHA-BUCH GmbH
(Einbeck, Alemania)

Descripción Buch. Condición: Neu. Druck auf Anfrage Neuware - Printed after ordering - At first glance the concepts of time and of Petri nets are quite contrary: while time determines the occurrences of events in a system, classic Petri nets consider their causal relationships and they represent events as concurrent systems. But if we take a closer look at how time and causality are intertwined we realize that there are many possible ways in which time and Petri nets interact. This book takes a closer look at three time-dependent Petri nets: Time Petri nets, Timed Petri nets, and Petri nets with time windows.The author first explains classic Petri nets and their fundamental properties. Then the pivotal contribution of the book is the introduction of different algorithms that allow us to analyze time-dependent Petri nets. For Time Petri nets, the author presents an algorithm that proves the behavioral equivalence of a net where time is designed once with real and once with natural numbers, so we can reduce the state space and consider the integer states exclusively. For Timed Petri nets, the author introduces two time-dependent state equations, providing a sufficient condition for the non-reachability of states, and she also defines a local transformation for converting these nets into Time Petri nets. Finally, she shows that Petri nets with time-windows have the ability to realize every transition sequence fired in the net omitting time restrictions.These classes of time-dependent Petri nets show that time alone does not change the power of a Petri net, in fact time may or may not be used to force firing. For Time Petri nets and Timed Petri nets we can say that they are Turing-powerful, and thus more powerful than classic Petri nets, because there is a compulsion to fire at some point in time. By contrast, Petri nets with time-windows have no compulsion to fire, their expressiveness power is less than that of Turing-machines.This book derives from advanced lectures, and the text is supported throughout with examples and exercises. It is suitable for graduate courses in computer science, mathematics, engineering, and related disciplines, and as a reference for researchers. Nº de ref. del artículo: 9783642411144

Más información sobre este vendedor | Contactar al vendedor

Comprar nuevo
EUR 56,69
Convertir moneda

Añadir al carrito

Gastos de envío: EUR 32,99
De Alemania a Estados Unidos de America
Destinos, gastos y plazos de envío