Time and Petri Nets

Time and Petri Nets

Louchka Popova-Zeugmann

68,41 €
IVA incluido
Disponible
Editorial:
Springer Nature B.V.
Año de edición:
2016
Materia
Programación informática/desarrollo de software
ISBN:
9783662514351
68,41 €
IVA incluido
Disponible

Selecciona una librería:

  • Librería Samer Atenea
  • Librería Aciertas (Toledo)
  • Kálamo Books
  • Librería Perelló (Valencia)
  • Librería Elías (Asturias)
  • Donde los libros
  • Librería Kolima (Madrid)
  • Librería Proteo (Málaga)

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.

Artículos relacionados

  • SPARK 2014 Reference Manual
    AdaCore / Altran UK Ltd
    SPARK 2014 is a programming language and a set of verification tools designed to meet the needs of high-assurance software development. SPARK 2014 is based on Ada 2012, both subsetting the language to remove features that defy verification, but also extending the system of contracts and aspects to support modular, formal verification.This manual is available online for free at ...
    Disponible

    19,91 €

  • Software and Intelligent Sciences
    Yingxu Wang
    The junction of software development and engineering combined with the study of intelligence has created a bustling intersection of theory, design, engineering, and conceptual thought. Software and Intelligent Sciences: New Transdisciplinary Findings sits at a crossroads and informs advanced researchers, students, and practitioners on the developments in computer science, theor...
  • Power System Planning Technologies and Applications
    Fawwaz Elkarmi / Nazih Abu Shikhah / Nazih Abu-Shikhah
    Planning is an important function of the management of any business, providing knowledge of future prospects and enabling prudent and appropriate decision-making. Planning is especially critical for power systems, since electricity is a fundamental part of modern societies and many conventional electrical energy resources currently in use are limited. Power System Planning Tech...
  • Concept Parsing Algorithms (CPA) for Textual Analysis and Discovery
    Masha Etkind / Uri Shafrir
    Text analysis tools aid in extracting meaning from digital content. As digital text becomes more and more complex, new techniques are needed to understand conceptual structure. Concept Parsing Algorithms (CPA) for Textual Analysis and Discovery: Emerging Research and Opportunities provides an innovative perspective on the application of algorithmic tools to study unstructured d...
  • Model-Based Design for Effective Control System Development
    Wei Wu
    Control systems are an integral aspect of modern society and exist across numerous domains and applications. As technology advances more and more, the complexity of such systems continues to increase exponentially. Model-Based Design for Effective Control System Development is a critical source of scholarly information on model-centric approaches and implementations for control...
  • Verification, Validation and Testing in Software Engineering
    ...

Otros libros del autor

  • Time and Petri Nets
    Louchka Popova-Zeugmann
    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 ...