Sciweavers

1116 search results - page 55 / 224
» Applying Predicate Abstraction to Abstract State Machines
Sort
View
CONCUR
2006
Springer
15 years 4 months ago
A Livelock Freedom Analysis for Infinite State Asynchronous Reactive Systems
We describe an incomplete but sound and efficient livelock freedom test for infinite state asynchronous reactive systems. The method s a system into a set of simple control flow cy...
Stefan Leue, Alin Stefanescu, Wei Wei
ECML
2003
Springer
15 years 6 months ago
Self-evaluated Learning Agent in Multiple State Games
Abstract. Most of multi-agent reinforcement learning algorithms aim to converge to a Nash equilibrium, but a Nash equilibrium does not necessarily mean a desirable result. On the o...
Koichi Moriyama, Masayuki Numao
105
Voted
ICTAC
2009
Springer
15 years 7 months ago
Input-Output Model Programs
Abstract. Model programs are used as high-level behavioral specifications typically representing abstract state machines. For modeling reactive systems, one uses input-output mode...
Margus Veanes, Nikolaj Bjørner
ICW
2005
IEEE
130views Communications» more  ICW 2005»
15 years 6 months ago
A Finite-State Markov Chain Model for Statistical Loss Across a RED Queue
Abstract— In this paper, we present an analytical study targeted at statistically capturing the loss behavior of a RED queue. We utilize a finite-state Markov chain model. Start...
Mohit B. Singh, Homayoun Yousefi'zadeh, Hamid Jafa...
92
Voted
ICCS
2007
Springer
15 years 7 months ago
Composing Different Models of Computation in Kepler and Ptolemy II
A model of computation (MoC) is a formal abstraction of execution in a computer. There is a need for composing MoCs in e-science. Kepler, which is based on Ptolemy II, is a scienti...
Antoon Goderis, Christopher Brooks, Ilkay Altintas...