Sciweavers

369 search results - page 15 / 74
» Canonical finite state machines for distributed systems
Sort
View
FORTE
2004
13 years 9 months ago
Formal Composition of Distributed Scenarios
Eliciting, modeling, and analyzing the requirements are the main challenges to face up when you want to produce a formal specification for distributed systems. The distribution and...
Aziz Salah, Rabeb Mizouni, Rachida Dssouli, Benoit...
ISSTA
1998
ACM
13 years 11 months ago
Improving Efficiency of Symbolic Model Checking for State-Based System Requirements
We present various techniques for improving the time and space efficiency of symbolic model checking for system requirements specified as synchronous finite state machines. We use...
William Chan, Richard J. Anderson, Paul Beame, Dav...
ICML
2010
IEEE
13 years 8 months ago
Finite-Sample Analysis of LSTD
In this paper we consider the problem of policy evaluation in reinforcement learning, i.e., learning the value function of a fixed policy, using the least-squares temporal-differe...
Alessandro Lazaric, Mohammad Ghavamzadeh, Ré...
ATAL
2003
Springer
14 years 26 days ago
Implementing responsibility for states and events
Contracts in the real world often rest upon a notion of responsibility, by which parties commit to the fulfilment of particular imperatives embedded in the contract. Responsibili...
Martin J. Kollingbaum, Timothy J. Norman, Chris Re...
ASM
2005
ASM
14 years 1 months ago
Time in State Machines
State machines are considered a very general means of expressing computations in an implementation-independent way. There are also ways to extend the general state machine framewor...
Susanne Graf, Andreas Prinz