Sciweavers

93 search results - page 11 / 19
» Dependency-Based Action Refinement
Sort
View
JCP
2008
139views more  JCP 2008»
13 years 7 months ago
Agent Learning in Relational Domains based on Logical MDPs with Negation
In this paper, we propose a model named Logical Markov Decision Processes with Negation for Relational Reinforcement Learning for applying Reinforcement Learning algorithms on the ...
Song Zhiwei, Chen Xiaoping, Cong Shuang
IJFCS
2006
106views more  IJFCS 2006»
13 years 7 months ago
A Timed Failure Equivalence Preserving Abstraction for Parametric Time-interval Automata
ion for Parametric Time-Interval Automata Akio Nakata, Tadaaki Tanimoto, Suguru Sasaki, Teruo Higashino Department of Information Networking, Graduate School of Information Science...
Akio Nakata, Tadaaki Tanimoto, Suguru Sasaki, Teru...
SOSE
2006
IEEE
14 years 1 months ago
Formal incremental requirements specification of service-oriented automotive software systems
In this paper, we introduce a simple but formal service description language (ForSeL) for modelbased requirements engineering. The basic notion in ForSeL is a service representing...
Judith Hartmann, Sabine Rittmann, Doris Wild, Pete...
ICFEM
2000
Springer
13 years 11 months ago
Fragmented Retrenchment, Concurrency and Fairness
Retrenchment is presented in a simple relational framework as a more flexible development concept than refinement for capturing the early preformal stages of development, and brie...
Richard Banach, Michael Poppleton
HICSS
1995
IEEE
110views Biometrics» more  HICSS 1995»
13 years 11 months ago
Reliability analysis of CSP specifications using Petri nets and Markov processes
In our research we are developing methodologiesand tools to permit stochastic analyses of CSP-based system specifications. In this regard, we have been developing morphismsbetween...
Krishna M. Kavi, Frederick T. Sheldon, Behrooz Shi...