Zobrazeno 1 - 10
of 97
pro vyhledávání: '"trace monoid"'
Publikováno v:
Моделирование и анализ информационных систем, Vol 20, Iss 2, Pp 92-103 (2013)
Petri net is said to be elementary if every place can contain no more than one token. In this paper, it is studied topological properties of the elementary Petri net for a pipeline consisting of n functional devices. If the work of the functional dev
Externí odkaz:
https://doaj.org/article/251afb7e35d7496c891737f27094a7ee
We show that the commonly held assumption that walks can be used to infer properties of digraphs is highly problematic. Since in particular closed walks are describable from combinations of simple cycles, we study the trace monoid formed by these cyc
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::9b7859d3611bf6b8617eaea034aff899
https://hal.archives-ouvertes.fr/hal-03408041/file/main.pdf
https://hal.archives-ouvertes.fr/hal-03408041/file/main.pdf
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Samy Abbes
Publikováno v:
Application and Theory of Petri Nets and Concurrency. Petri Nets 2021
Application and Theory of Petri Nets and Concurrency. Petri Nets 2021, pp.423-442, 2021, ⟨10.1007/978-3-030-76983-3_21⟩
Application and Theory of Petri Nets and Concurrency ISBN: 9783030769826
Petri Nets
Application and Theory of Petri Nets and Concurrency. Petri Nets 2021, pp.423-442, 2021, ⟨10.1007/978-3-030-76983-3_21⟩
Application and Theory of Petri Nets and Concurrency ISBN: 9783030769826
Petri Nets
Deterministic concurrent system are “locally commutative” concurrent systems. We characterise these systems by means of their combinatorial properties.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::bebcf90b8e9d13ccdfa64bdfb900ffcd
https://hal.archives-ouvertes.fr/hal-03267060
https://hal.archives-ouvertes.fr/hal-03267060
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, Vol DMTCS Proceedings vol. AS,..., Iss Proceedings (2013)
A poset is $(3+1)$-free if it does not contain the disjoint union of chains of length 3 and 1 as an induced subposet. These posets are the subject of the $(3+1)$-free conjecture of Stanley and Stembridge. Recently, Lewis and Zhang have enumerated $\t
Externí odkaz:
https://doaj.org/article/4fefd268d87a46adb951b8d9c4c960cb
Publikováno v:
Discrete Mathematics. 341:1439-1448
Simple cycles, also known as self-avoiding polygons, are cycles on graphs which are not allowed to visit any vertex more than once. We present an exact formula for enumerating the simple cycles of any length on any directed graph involving a sum over
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e1692b682c5475b199c755b4a2f5dfcd
https://doi.org/10.1016/j.disc.2017.10.002
https://doi.org/10.1016/j.disc.2017.10.002
Autor:
Matthew S. Macauley, Shih-Wei Chao
As a visualization of Cartier and Foata's "partially commutative monoid" theory, G.X. Viennot introduced "heaps of pieces" in 1986. These are essentially labeled posets satisfying a few additional properties. They naturally arise as models of reduced
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::74867b4a63197be3e71bfb072245f7e0
http://arxiv.org/abs/1912.08859
http://arxiv.org/abs/1912.08859
Autor:
Oussama Ajbal
Publikováno v:
Communications in Algebra. 44:2685-2706
E. Rodaro and P. V. Silva proved recently that the fixed points submonoid and the periodic points submonoid of a trace monoid endomorphism are always finitely generated. We show that for finitely generated left preGarside monoids, the fixed and perio
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::0b533de4657c84f6b5122d5158d943a5
https://doi.org/10.1080/00927872.2015.1065842
https://doi.org/10.1080/00927872.2015.1065842
Publikováno v:
Modelirovanie i Analiz Informacionnyh Sistem, Vol 20, Iss 2, Pp 92-103 (2013)
Petri net is said to be elementary if every place can contain no more than one token. In this paper, it is studied topological properties of the elementary Petri net for a pipeline consisting of n functional devices. If the work of the functional dev
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::3d9225f650645df6ca835a52b0926a0e
https://doi.org/10.18255/1818-1015-2013-2-92-103
https://doi.org/10.18255/1818-1015-2013-2-92-103
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.