Sciweavers

6167 search results - page 8 / 1234
» Can Refinement be Automated
Sort
View
108
Voted
IJAOSE
2010
126views more  IJAOSE 2010»
14 years 10 months ago
Automated analysis of compositional multi-agent systems
An approach for handling the complex dynamics of a multi-agent system is based on distinguishing aggregation levels. The behaviour at a given aggregation level is specified by a se...
Alexei Sharpanskykh, Jan Treur
115
Voted
DAC
2004
ACM
16 years 1 months ago
Refining the SAT decision ordering for bounded model checking
Bounded Model Checking (BMC) relies on solving a sequence of highly correlated Boolean satisfiability (SAT) problems, each of which corresponds to the existence of counter-example...
Chao Wang, HoonSang Jin, Gary D. Hachtel, Fabio So...
97
Voted
MPC
1995
Springer
91views Mathematics» more  MPC 1995»
15 years 4 months ago
A Refinement Relation Supporting the Transition from Unbounded to Bounded Communication Buffers
This paper proposes a refinement relation supporting the transition from unbounded to bounded communication buffers. Employing this refinement relation, a system specification base...
Ketil Stølen
111
Voted
ASM
2008
ASM
15 years 2 months ago
A First Attempt to Express KAOS Refinement Patterns with Event B
anguage (Event B), hence staying at the same abstraction level. Thus we take advantage from the Event B method: (i) it is possible to use the method during the whole development pr...
Abderrahman Matoussi, Frédéric Gerva...
83
Voted
IM
2007
15 years 2 months ago
Realising Adaptive Web Services through Automated Policy Refinement
Traditionally policy based management systems have relied on 'engineered' policy refinement to decompose high level
Kevin Carey, Vincent Wade