Search Sciweavers | Sciweavers

35

IJAOSE
2010

126views more IJAOSE 2010»

Automated analysis of compositional multi-agent systems

13 years 7 months ago

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

claim paper

Read More »

40

click to vote

DAC
2004
ACM

168views Computer Architecture» more DAC 2004»

Refining the SAT decision ordering for bounded model checking

14 years 10 months ago

Download vlsi.colorado.edu

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...

claim paper

Read More »

32

click to vote

MPC
1995
Springer

91views Mathematics» more MPC 1995»

A Refinement Relation Supporting the Transition from Unbounded to Bounded Communication Buffers

14 years 1 months ago

Download folk.uio.no

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

claim paper

Read More »

37

click to vote

ASM
2008
ASM

157views Computational Biology» more ASM 2008»

A First Attempt to Express KAOS Refinement Patterns with Event B

13 years 11 months ago

Download pages.usherbrooke.ca

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...

claim paper

Read More »

27

click to vote

IM
2007

120views Computer Networks» more IM 2007»

Realising Adaptive Web Services through Automated Policy Refinement

13 years 11 months ago