Sciweavers

878 search results - page 109 / 176
» Interacting Abstract State Machines
Sort
View
AMCS
2011
341views Mathematics» more  AMCS 2011»
14 years 4 months ago
FSP and FLTL framework for specification and verification of middle-agents
Agents are a useful abstraction frequently employed as a basic building block in modeling service, information and resource sharing in global environments. The connecting of reques...
Amelia Badica, Costin Badica
FLAIRS
2000
14 years 11 months ago
Autonomous Automobile Behavior through Context-Based Reasoning
Today's driving simulators are used in vehicle research and design as well as in training. However, most simulators are not convincing because the degree of realism is not ad...
Fernando G. Gonzalez, Patrick Grejs, Avelino J. Go...
CORR
2012
Springer
215views Education» more  CORR 2012»
13 years 5 months ago
Du TAL au TIL
position paper. Historically two types of NLP have been investigated: fully automated processing of language by machines (NLP) and autonomous processing of natural language by peop...
Michael Zock, Guy Lapalme
IOLTS
2009
IEEE
231views Hardware» more  IOLTS 2009»
15 years 4 months ago
Designing fault tolerant FSM by nano-PLA
— The paper deals with designing fault tolerant finite state machines (FSMs) by nanoelectronic programmable logic arrays (PLAs). Two main critical parameters of the fault toleran...
Samary Baranov, Ilya Levin, Osnat Keren, Mark G. K...
ATVA
2007
Springer
136views Hardware» more  ATVA 2007»
15 years 4 months ago
Symbolic Fault Tree Analysis for Reactive Systems
Fault tree analysis is a traditional and well-established technique for analyzing system design and robustness. Its purpose is to identify sets of basic events, called cut sets, wh...
Marco Bozzano, Alessandro Cimatti, Francesco Tappa...