Sciweavers

206 search results - page 24 / 42
» Probabilistic Analysis of Large Finite State Machines
Sort
View
AICT
2006
IEEE
210views Communications» more  AICT 2006»
15 years 5 months ago
Model-Based Analysis of Obligations in Web Service Choreography
In this paper we discuss a model-based approach to the analysis of service interactions for coordinated web service compositions using obligation policies specified in the form of...
Howard Foster, Sebastián Uchitel, Jeff Mage...
GECCO
2006
Springer
185views Optimization» more  GECCO 2006»
15 years 3 months ago
Memory analysis and significance test for agent behaviours
Many agent problems in a grid world have a restricted sensory information and motor actions. The environmental conditions need dynamic processing of internal memory. In this paper...
DaeEun Kim
ICSE
2003
IEEE-ACM
15 years 11 months ago
Modular Verification of Software Components in C
We present a new methodology for automatic verification of C programs against finite state machine specifications. Our approach is compositional, naturally enabling us to decompos...
Sagar Chaki, Edmund M. Clarke, Alex Groce, Somesh ...
DCC
2004
IEEE
15 years 11 months ago
Periodicity and Correlation Properties of d-FCSR Sequences
A d-feedback-with-carry shift register (d-FCSR) is a finite state machine, similar to a linear feedback shift register, in which a small amount of memory and a delay (by d-clock c...
Mark Goresky, Andrew Klapper
AGENTCL
2000
Springer
15 years 4 months ago
Using Colored Petri Nets for Conversation Modeling
Conversations are a useful means of structuring communicative interactions among agents. The value of a conversation-based approach is largely determined by the conversational mod...
R. Scott Cost, Ye Chen, Timothy W. Finin, Yannis L...