Zobrazeno 1 - 10
of 21
pro vyhledávání: '"Amnon Rosenmann"'
Autor:
Amnon, Rosenmann
Publikováno v:
Journal of combinatorial optimization. 44(2)
The
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=pmid________::f9897594662657f404054811da09f327
https://pubmed.ncbi.nlm.nih.gov/35979402
https://pubmed.ncbi.nlm.nih.gov/35979402
Autor:
Amnon Rosenmann
The $k$-cardinality assignment problem asks for finding a maximal (minimal) weight of a matching of cardinality $k$ in a weighted bipartite graph $K_{n,n}$, $k \leq n$. The algorithm of Gassner and Klinz from 2010 for the parametric assignment proble
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b73aa32d3420057ef6842c75bd5286c5
Publikováno v:
Real-Time Systems. 53:291-326
Deterministic timed automata are strictly less expressive than their non-deterministic counterparts, which are again less expressive than those with silent transitions. As a consequence, timed automata are in general non-determinizable. This is unfor
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::54208f5590767dc7a1cdfedecc24847f
https://doi.org/10.1007/s11241-017-9271-x
https://doi.org/10.1007/s11241-017-9271-x
Autor:
Amnon Rosenmann
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783030296612
FORMATS
FORMATS
Let \(\mathrm {eNTA}\) be the class of non-deterministic timed automata with silent transitions. Given \(A \in \mathrm {eNTA}\), we effectively compute its timestamp: the set of all pairs (time value, action) of all observable timed traces of A. We s
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7f0f9c340eec975e2d5b000a8d389e3a
https://doi.org/10.1007/978-3-030-29662-9_11
https://doi.org/10.1007/978-3-030-29662-9_11
Autor:
Amnon Rosenmann
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783030296612
FORMATS
FORMATS
Some fundamental problems in the class of non-deterministic timed automata, like the problem of inclusion of the language accepted by timed automaton A (e.g., the implementation) in the language accepted by B (e.g., the specification) are, in general
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e3afcaaf1e2b8773f3cef381bd8cd04b
https://doi.org/10.1007/978-3-030-29662-9_12
https://doi.org/10.1007/978-3-030-29662-9_12
Publikováno v:
Journal of Combinatorial Theory, Series A. 178:105356
In this paper we prove that a uniformly distributed random circular automaton $\mathcal{A}_n$ of order $n$ synchronizes with high probability (whp). More precisely, we prove that $$ \mathbb{P}\left[\mathcal{A}_n \text{ synchronizes}\right] = 1- O\lef
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::6ffc668bad4fed878618a539ba8d683b
https://doi.org/10.1016/j.jcta.2020.105356
https://doi.org/10.1016/j.jcta.2020.105356
Recently, in a work that grew out of their exploration of interlacing polynomials, Marcus, Spielman and Srivastava and then Marcus studied certain combinatorial polynomial convolutions. These convolutions preserve real-rootedness and capture expectat
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::ab0342fa31fd6ffae988b2dac9ab33c6
http://arxiv.org/abs/1802.07373
http://arxiv.org/abs/1802.07373
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783319229744
FORMATS
FORMATS
Deterministic timed automata are strictly less expressive than their non-deterministic counterparts, which are again less expressive than those with silent transitions. As a consequence, timed automata are in general non-determinizable. This is unfor
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::0357f2926eb554a2330ccb0272d714c9
https://doi.org/10.1007/978-3-319-22975-1_19
https://doi.org/10.1007/978-3-319-22975-1_19
Autor:
Amnon Rosenmann
We present a novel approach, which is based on multiple-valued logic (MVL), to the verification and analysis of digital hardware designs, which extends the common ternary or quaternary approaches for simulations. The simulations which are performed i
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::58d821a9b58dab57f2538e593bd238e8