Zobrazeno 1 - 10
of 17
pro vyhledávání: '"Evgeny Erofeev"'
Autor:
Evgeny Erofeev, Vadim Arykov, Michael Stepanenko, Aleksei Voevodin, Aleksei Kogai, Vladimir Kurikalov
Publikováno v:
Symmetry, Vol 12, Iss 7, p 1167 (2020)
Millimeter-wave wireless networks of the new fifth generation (5G) have become a primary focus in the development of the information and telecommunication industries. It is expected that 5G wireless networks will increase the data rates and reduce ne
Externí odkaz:
https://doaj.org/article/84dc726f2a0041f39e1a1b1bccb5dd72
Autor:
Ronny Tredup, Evgeny Erofeev
Publikováno v:
Theoretical Computer Science. 890:36-69
Though constructing a sequential system model may be technically uncomplicated and rather ‘straightforward’, its result is often cumbersome and difficult to analyze since all possible interleavings of system's actions have to be present. This nat
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::0fd25bf584c7a72a9570e3e2d99e0990
https://doi.org/10.1016/j.tcs.2021.08.014
https://doi.org/10.1016/j.tcs.2021.08.014
Publikováno v:
Transactions on Petri Nets and Other Models of Concurrency XV ISBN: 9783662630785
In previous studies, several methods have been developed to synthesise Petri nets from labelled transition systems (LTS), often with structural constraints on the net and on the LTS. In this paper, we focus on Weighted Marked Graphs (WMGs) and Choice
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::3aeabf02249b48106199091ae3d021ca
https://doi.org/10.1007/978-3-662-63079-2_4
https://doi.org/10.1007/978-3-662-63079-2_4
When a Petri net is synthesised from a labelled transition system, it is frequently desirable that certain additional constraints are fulfilled. For example, in circuit design, one is often interested in constructing safe Petri nets. Targeting such s
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c567952e35d9e42747415ee4010fa3e4
https://doi.org/10.3233/stal200007
https://doi.org/10.3233/stal200007
Autor:
Ronny Tredup, Evgeny Erofeev
Modeling of real-world systems with Petri nets allows to benefit from their generic concepts of parallelism, synchronisation and conflict, and obtain a concise yet expressive system representation. Algorithms for synthesis of a net from a sequential
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::5ae3c9168623faa88bffeb71ec26d383
http://arxiv.org/abs/2009.08871
http://arxiv.org/abs/2009.08871
Publikováno v:
Fundamenta informaticae, 175 (1-4
When a Petri net is synthesised from a labelled transition system, it is frequently desirable that certain additional constraints are fulfilled. For example, in circuit design, one is often interested in constructing safe Petri nets. Targeting such s
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::6d51b40582c08551fe1048fa8bf97f5e
http://hdl.handle.net/2013/ULB-DIPOT:oai:dipot.ulb.ac.be:2013/313935
http://hdl.handle.net/2013/ULB-DIPOT:oai:dipot.ulb.ac.be:2013/313935
Autor:
Evgeny Erofeev, Ronny Tredup
Publikováno v:
Theoretical Aspects of Computing – ICTAC 2020 ISBN: 9783030642754
ICTAC
ICTAC
For a Boolean type of nets \(\tau \), a transition system A is synthesizeable into a \(\tau \)-net N if and only if distinct states of A correspond to distinct markings of N, and N prevents a transition firing if there is no related transition in A.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1d2fe56a3fe917c46c3d0c20e4133285
https://doi.org/10.1007/978-3-030-64276-1_7
https://doi.org/10.1007/978-3-030-64276-1_7
Autor:
Ronny Tredup, Evgeny Erofeev
Publikováno v:
Theoretical Aspects of Computing – ICTAC 2020 ISBN: 9783030642754
ICTAC
ICTAC
Let \(\tau \) be a Boolean type of net. For a given transition system A and a natural number \(\rho \), the problem occupancy \(\rho \)-restricted \(\tau \)-synthesis (OR\(\tau \) S) is the task to decide whether there is a Boolean Petri net N of typ
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::3ad63fc2345791b56dd830ed399af1e2
https://doi.org/10.1007/978-3-030-64276-1_8
https://doi.org/10.1007/978-3-030-64276-1_8
Publikováno v:
Application and Theory of Petri Nets and Concurrency ISBN: 9783030518301
Petri Nets
Petri Nets
When a Petri net system of some class is synthesised from a labelled transition system, it may be interesting to derive structural properties of the corresponding reachability graphs and to use them in a pre-synthesis phase in order to quickly reject
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::2b4324935c808d9c0dc9e6d64c695825
https://doi.org/10.1007/978-3-030-51831-8_5
https://doi.org/10.1007/978-3-030-51831-8_5
Autor:
Ronny Tredup, Evgeny Erofeev
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783030592660
TAMC
TAMC
In this paper, we investigate the parameterized complexity of d-restricted \(\tau \)-synthesis (dR\(\tau \)S) parameterized by d for a range of Boolean types of nets \(\tau \). We show that dR\(\tau \)S is W[1]-hard for 64 of 128 possible Boolean typ
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::bc5f41e814e0213c8818bdf85a247125
https://doi.org/10.1007/978-3-030-59267-7_20
https://doi.org/10.1007/978-3-030-59267-7_20