Sciweavers

1791 search results - page 305 / 359
» Semantics and Complexity of SPARQL
Sort
View
ENTCS
2010
88views more  ENTCS 2010»
15 years 4 months ago
On the Observable Behaviour of Composite Components
The crucial strength of the component paradigm lies in the possibility to encapsulate behaviours. In this work, we focus on the observable behaviour of composite components which ...
Rolf Hennicker, Stephan Janisch, Alexander Knapp
ENTCS
2010
96views more  ENTCS 2010»
15 years 4 months ago
Optimizing Conditional Logic Reasoning within CoLoSS
The generic modal reasoner CoLoSS covers a wide variety of logics ranging from graded and probabilistic modal logic to coalition logic and conditional logics, being based on a bro...
Daniel Hausmann, Lutz Schröder
IANDC
2008
120views more  IANDC 2008»
15 years 4 months ago
A framework for compositional verification of security protocols
Automatic security protocol analysis is currently feasible only for small protocols. Since larger protocols quite often are composed of many small protocols, compositional analysi...
Suzana Andova, Cas J. F. Cremers, Kristian Gj&osla...
CLEIEJ
2006
88views more  CLEIEJ 2006»
15 years 4 months ago
A Stochastic Concurrent Constraint Based Framework to Model and Verify Biological Systems
Concurrent process calculi are powerful formalisms for modelling concurrent systems. The mathematical style underlying process calculi allow to both model and verify properties of...
Carlos Olarte, Camilo Rueda
ENTCS
2006
173views more  ENTCS 2006»
15 years 4 months ago
Concurrent LSC Verification: On Decomposition Properties of Partially Ordered Symbolic Automata
Partially Ordered Symbolic Automata (POSAs) are used as the semantical foundation of visual formalisms like the scenario based language of Live Sequence Charts (LSCs). To check whe...
Tobe Toben, Bernd Westphal