Sciweavers

1173 search results - page 109 / 235
» On the Compositionality of Round Abstraction
Sort
View
103
Voted
ITA
2007
15 years 19 days ago
Three notes on the complexity of model checking fixpoint logic with chop
Abstract. This paper analyses the complexity of model checking Fixpoint Logic with Chop – an extension of the modal µ-calculus with a sequential composition operator. It uses tw...
Martin Lange
105
Voted
CORR
2010
Springer
101views Education» more  CORR 2010»
15 years 9 days ago
Universal Loop-Free Super-Stabilization
Abstract. We propose an univesal scheme to design loop-free and superstabilizing protocols for constructing spanning trees optimizing any tree metrics (not only those that are isom...
Lélia Blin, Maria Potop-Butucaru, Stephane ...
118
Voted
OTM
2010
Springer
14 years 10 months ago
Composing Near-Optimal Expert Teams: A Trade-Off between Skills and Connectivity
Abstract. Rapidly changing business requirements necessitate the adhoc composition of expert teams to handle complex business cases. Expertcentric properties such as skills, howeve...
Christoph Dorn, Schahram Dustdar
ESWS
2009
Springer
14 years 10 months ago
Towards an Agent Based Approach for Verification of OWL-S Process Models
Abstract. In this paper we investigate the transformation of OWL-S process models to ISPL - the system description language for MCMAS, a symbolic model checker for multi agent syst...
Alessio Lomuscio, Monika Solanki
98
Voted
ESOP
2007
Springer
15 years 7 months ago
Interprocedurally Analysing Linear Inequality Relations
In this paper we present an alternative approach to interprocedurally g linear inequality relations. We propose an abstraction of the effects of procedures through convex sets of t...
Helmut Seidl, Andrea Flexeder, Michael Petter