Sciweavers

290 search results - page 39 / 58
» Logical Properties of Name Restriction
Sort
View
ENTCS
2006
123views more  ENTCS 2006»
13 years 10 months ago
From Discrete Duration Calculus to Symbolic Automata
The goal of this paper is to translate (fragments of) the quantified discrete duration calculus QDDC, proposed by P. Pandya, into symbolic acceptors with counters. Acceptors are w...
Laure Gonnord, Nicolas Halbwachs, Pascal Raymond
ESWS
2009
Springer
13 years 7 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
FAC
2008
97views more  FAC 2008»
13 years 10 months ago
A functional formalization of on chip communications
This paper presents a formal model and a systematic approach to the validation of communication tures at a high level of abstraction. This model is described mathematically by a fu...
Julien Schmaltz, Dominique Borrione
CADE
2008
Springer
14 years 10 months ago
Proving Group Protocols Secure Against Eavesdroppers
Security protocols are small programs designed to ensure properties such as secrecy of messages or authentication of parties in a hostile environment. In this paper we investigate ...
Steve Kremer, Antoine Mercier 0002, Ralf Treinen
AGILE
2007
Springer
127views GIS» more  AGILE 2007»
14 years 4 months ago
Space-contained conflict revision, for geographic information
Using qualitative reasoning with geographic information, contrarily, for instance, with robotics, looks not only fastidious (i.e.: encoding knowledge Propositional Logics PL), but ...
Omar Doukari, Robert Jeansoulin