Zobrazeno 1 - 10
of 147
pro vyhledávání: '"Maler, Oded"'
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:
Mens, Irini-Eleftheria, Maler, Oded
Publikováno v:
Logical Methods in Computer Science, Volume 11, Issue 3 (September 17, 2015) lmcs:1589
This work is concerned with regular languages defined over large alphabets, either infinite or just too large to be expressed enumeratively. We define a generic model where transitions are labeled by elements of a finite partition of the alphabet. We
Externí odkaz:
http://arxiv.org/abs/1506.00482
Publikováno v:
EPTCS 154, 2014, pp. 78-92
We propose a tool-supported methodology for design-space exploration for embedded systems. It provides means to define high-level models of applications and multi-processor architectures and evaluate the performance of different deployment (mapping,
Externí odkaz:
http://arxiv.org/abs/1406.2071
Autor:
Maler, Oded
Publikováno v:
EPTCS 140, 2014, pp. 48-69
We provide a tutorial introduction to reachability computation, a class of computational techniques that exports verification technology toward continuous and hybrid systems. For open under-determined systems, this technique can sometimes replace an
Externí odkaz:
http://arxiv.org/abs/1403.0952
Autor:
FERRÈRE, THOMAS1 (AUTHOR), MALER, ODED2 (AUTHOR), NIČKOVIĆ, DEJAN3 (AUTHOR), PNUELI, AMIR4 (AUTHOR)
Publikováno v:
Journal of the ACM. Jun2019, Vol. 66 Issue 3, p1-31. 31p.
Publikováno v:
EPTCS 125, 2013, pp. 84-91
We present the Populus toolkit for exploring the dynamics of mass action systems under different assumptions.
Comment: In Proceedings HSB 2013, arXiv:1308.5724
Comment: In Proceedings HSB 2013, arXiv:1308.5724
Externí odkaz:
http://arxiv.org/abs/1309.0871
Autor:
Ben-Bassat, Moshe, Maler, Oded
Control Strategies for hierarchical tree-like probabilistic inference networks are formulated and investigated. Strategies that utilize staged look-ahead and temporary focus on subgoals are formalized and refined using the Depth Vector concept that s
Externí odkaz:
http://arxiv.org/abs/1304.3435
Publikováno v:
EPTCS 39, 2010, pp. 33-46
We propose an extension of the zone-based algorithmics for analyzing timed automata to handle systems where timing uncertainty is considered as probabilistic rather than set-theoretic. We study duration probabilistic automata (DPA), expressing multip
Externí odkaz:
http://arxiv.org/abs/1011.0219
Publikováno v:
In Microprocessors and Microsystems November 2013 37(8) Part A:848-857