Zobrazeno 1 - 10
of 403
pro vyhledávání: '"Eike Best"'
Autor:
Eike Best, Uli Schlachter
Publikováno v:
Electronic Proceedings in Theoretical Computer Science, Vol 189, Iss Proc. ICE 2015, Pp 53-67 (2015)
This paper describes a stand-alone, no-frills tool supporting the analysis of (labelled) place/transition Petri nets and the synthesis of labelled transition systems into Petri nets. It is implemented as a collection of independent, dedicated algorit
Externí odkaz:
https://doaj.org/article/1787b44c4a9b4517b0e973a70a39b2a5
Autor:
Eike Best, Raymond Devillers
Petri nets model concurrent and distributed systems where active components communicate through the production and absorption of various kinds of resources. Although the dynamic properties of such systems may be very complex, they may sometimes be c
Publikováno v:
Electronic Proceedings in Theoretical Computer Science, Vol 51, Iss Proc. SecCo 2010, Pp 16-33 (2011)
Non-interference, in transitive or intransitive form, is defined here over unbounded (Place/Transition) Petri nets. The definitions are adaptations of similar, well-accepted definitions introduced earlier in the framework of labelled transition syste
Externí odkaz:
https://doaj.org/article/aabb38df618f4cc9ad3a9d1f677e3c15
Publikováno v:
Scientific Annals of Computer Science, Vol XXVIII, Iss 2, Pp 199-236 (2018)
Petri net synthesis deals with the problem whether, given a labelled transition system TS, one can find a Petri net N with an initial marking M0 such that the reachability graph of (N. M0) is isomorphic to TS. This may be preceded by a pre-synthesis
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e1356abcbe9ae3295c169e1d3f43bf26
http://www.info.uaic.ro/bin/download/Annals/XXVIII2/XXVIII2_2.pdf
http://www.info.uaic.ro/bin/download/Annals/XXVIII2/XXVIII2_2.pdf
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
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
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:
Raymond Devillers, Eike Best
Publikováno v:
Science of Computer Programming. 157:41-55
This paper proposes a fail-fast pre-synthesis method supporting the synthesis of unlabelled Petri nets from labelled transition systems, while focusing on the class of choice-free systems. Such systems have applications, amongst others, in hardware d
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5d2fec61195b2dadf20ad4f63500ad2c
https://doi.org/10.1016/j.scico.2017.07.005
https://doi.org/10.1016/j.scico.2017.07.005
Publikováno v:
Acta informatica, 55 (7
This paper describes a synthesis procedure dedicated to the construction of choice-free Petri nets from finite persistent transition systems, whenever possible. Taking advantage of the properties of choice-free Petri nets, a two-step approach is prop
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a311e6f4d7319590c1bceaa86476e6af
https://doi.org/10.1007/s00236-017-0310-9
https://doi.org/10.1007/s00236-017-0310-9
Autor:
Raymond Devillers, Eike Best
Publikováno v:
Information and Computation. 253:399-410
The structure of the reachability graph of a marked graph Petri net is fully characterised. Exact structural conditions are given for a given labelled transition system to be generated by a marked graph. Two cases are distinguished, corresponding to
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::86a8b3501d4fb3a652628b7e986a214b
https://doi.org/10.1016/j.ic.2016.06.006
https://doi.org/10.1016/j.ic.2016.06.006