Sleptsov Nets Run Fast

@article{Zaitsev2016SleptsovNR,
  title={Sleptsov Nets Run Fast},
  author={Dmitry A. Zaitsev},
  journal={IEEE Transactions on Systems, Man, and Cybernetics: Systems},
  year={2016},
  volume={46},
  pages={682-693}
}
  • Dmitry A. Zaitsev
  • Published in
    IEEE Transactions on Systems…
    2016
  • Computer Science
  • We show that Sleptsov place-transition nets (that allow transition firing in multiple instances at a step) run fast by implementing multiplication and division operations in polynomial time. In comparison, Petri nets (PNs) implement the mentioned operations in exponential time. Moreover, PNs are obtained as a special case of Sleptsov nets (SNs) using loops with places having unit marking attached to each transition. In addition, we develop basics of an SN programming technology including basic… CONTINUE READING

    Create an AI-powered research feed to stay up to date with new papers like this posted to ArXiv

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 48 REFERENCES

    Performance Evaluation of Networks

    VIEW 5 EXCERPTS
    HIGHLY INFLUENTIAL

    Paradigm of computations on the Petri nets

    VIEW 8 EXCERPTS
    HIGHLY INFLUENTIAL

    Toward the Minimal Universal Petri Net

    • Dmitry A. Zaitsev
    • Computer Science
    • IEEE Transactions on Systems, Man, and Cybernetics: Systems
    • 2014
    VIEW 9 EXCERPTS

    Small Polynomial Time Universal Petri Nets

    VIEW 10 EXCERPTS

    Universal petri net

    VIEW 5 EXCERPTS

    On the Computational Complexity of Spiking Neural P Systems

    VIEW 6 EXCERPTS
    HIGHLY INFLUENTIAL

    Equations and equivalent transformations of loaded Petri nets (algebraic approach)

    • A. I. Sleptsov
    • Proc. Comm. All-Union Conf. Formal Models Parallel Comput., Novosibirsk, Russia, 1988, pp. 151–158.
    • 1988
    VIEW 7 EXCERPTS
    HIGHLY INFLUENTIAL

    A Small Universal Petri Net

    VIEW 5 EXCERPTS