Qualification de graphes sémantiques à l'aide du Model Checking

2011

National audience; Qualification de graphes sémantiques à l'aide du Model Checking

Mapping SPARQL Query to temporal logic query based on NμSMV Model Checker to Query Semantic Graphs

2012

International audience; The RDF (W3C standard for metamodeling) language is the most frequently used to represent the semantic graphs. This paper presents a new research combining different fields that are: the semantic web and the model checking. We developed a tool, RDF2NμSMV, which converts RDF graphs into NμSMV language. This conversion aims checking the semantic graphs that have numerous errors of interpretation with the model checker NμSMV in order to verify the consistency of the data. The SPARQL query language is the standard for querying the semantic graph but have a lot of limitations. To this purpose, we define a translation from the SPARQL query language into the temporal logic …

Temporal Logic To Query Semantic Graphs Using The Model Checking Method

2012

International audience; Semantic interoperability problems have found their solutions due to the use of languages and techniques from the Semantic Web. The proliferations of ontologies and meta-information have improved the understanding of information and the relevance of search engine responses. However, the construction of semantic graphs is a source of numerous errors of interpretation or modeling, and scalability remains a major problem. The processing of large semantic graphs is a limit to the use of semantics in current information systems. The work presented in this paper is part of a new research at the border of two areas: the semantic web and the model checking. This line of rese…

RDF2SPIN: Mapping Semantic Graphs to SPIN Model Checker

2011

International audience; The most frequently used language to represent the semantic graphs is the RDF (W3C standard for meta-modeling). The construction of semantic graphs is a source of numerous errors of interpretation. The processing of large semantic graphs is a limit to the use of semantics in current information systems. The work presented in this paper is part of a new research at the border between two areas: the semantic web and the model checking. For this, we developed a tool, RDF2SPIN, which converts RDF graphs into SPIN language. This conversion aims checking the semantic graphs with the model checker SPIN in order to verify the consistency of the data. To illustrate our propos…

Formal Modeling and Discrete-Time Analysis of BPEL Web Services

2008

International audience; Web services are increasingly used for building enterprise information systems according to the Service Oriented Architecture (SOA) paradigm. We propose in this paper a tool-equipped methodology allowing the formal modeling and analysis of Web services described in the BPEL language. The discrete-time transition systems modeling the behavior of BPEL descriptions are obtained by an exhaustive simulation based on a formalization of BPEL semantics using the Algebra of Timed Processes (ATP). These models are then analyzed by model checking value-based temporal logic properties using the CADP toolbox. The approach is illustrated with the design of a Web service for GPS na…

RDF2NμSMV: Mapping Semantic Graphs to NμSMV Model Checker

2011

International audience; The most frequently used language to represent the semantic graphs is the RDF (W3C standard for meta-modeling). The construction of semantic graphs is a source of numerous errors of interpretation. The processing of large semantic graphs is a limit to the use of semantics in current information systems. The work presented in this paper is part of a new research at the border between two areas: the Semantic Web and the model checking. For this, we developed a tool, RDF2NμSMV, which converts RDF graphs into NμSMV language. This conversion aims checking the semantic graphs with the model checker NμSMV in order to verify the consistency of the data. To illustrate our pro…

Qualifying semantic graphs using model checking

2011

International audience; Semantic interoperability problems have found their solutions using languages and techniques from the Semantic Web. The proliferation of ontologies and meta-information has improved the understanding of information and the relevance of search engine responses. However, the construction of semantic graphs is a source of numerous errors of interpretation or modeling and scalability remains a major problem. The processing of large semantic graphs is a limit to the use of semantics in current information systems. The work presented in this paper is part of a new research at the border of two areas: the semantic web and the model checking. This line of research concerns t…

An Integrated Framework for Web Services Orchestration

2009

International audience; Currently, Web services give place to active research and this is due both to industrial and theoretical factors. On one hand, Web services are essential as the design model of applications dedicated to the electronic business. On the other hand, this model aims to become one of the major formalisms for the design of distributed and cooperative applications in an open environment (the Internet). In this article, the authors will focus on two features of Web services. The first one concerns the interaction problem: given the interaction protocol of a Web service described in BPEL, how to generate the appropriate client? Their approach is based on a formal semantics fo…

ScaleSem Approach to Check and to Query Semantic Graphs

2014

Des outils pour la vérification des Graphes Sémantiques

2010

National audience; Le langage le plus utilisée pour représenter les graphes sémantiques est RDF (standard du W3C). Les graphes RDF sont généralement stockés dans une base de données relationnelle et manipulés en utilisant le langage SQL ou les langages dérivées comme SPARQL. Malheureusement, cette solution, bien adapté pour les petits graphes RDF n'est pas bien adaptée pour les grands graphes RDF. Pour ces grands graphes RDF, nous proposons une nouvelle approche en utilisant la vérification formelle. Pendant nos recherches, on a développé deux outils RDF2SPIN et RDF2NuSMV qui permettent de convertir les graphes RDF vers un modèle et les vérifier avec l'outil SPIN et l'outil NuSMV respective…

A new approach based on NμSMV Model to query semantic graph

2011

International audience; The language most frequently used to represent the semantic graphs is the RDF (W3C standard for meta-modeling). The construction of semantic graphs is a source of numerous errors of interpretation. Processing of large semantic graphs can be a limit to use semantics in modern information systems. The work presented in this paper is part of a new research at the border between two areas: the semantic web and the model checking. For this, we developed a tool, RDF2NμSMV, which converts RDF graphs into NμSMV language. This conversion aims checking the semantic graphs with the model checker NμSMV in order to verify the consistency of the data. The data integration and shar…

A Formal Semantics and a Client Synthesis for a BPEL Service

2008

A complex Web service described with languages like BPEL4WS, consists of an executable process and its observable behaviour (called an abstract process) based on the messages exchanged with the client. The abstract process behaviour is non deterministic due to the internal choices during the service execution. Furthermore the specification often includes timing constraints which must be taken into account by the client. Thus given a service specification, we identify the synthesis of a client as a key issue for the development of Web services. To this end, we propose an approach based on (dense) timed automata to first describe the observable service behaviour and then to build correct inte…

Verifying Semantic Graphs With the Model Checker SPIN

2011

International audience; The most frequently used language to represent the semantic graphs is the RDF (W3C standard for meta-modeling). The construction of semantic graphs is a source of numerous errors of interpretation. The processing of large semantic graphs is a limit to the use of semantics in current information systems. The work presented in this paper is part of a new research at the border between two areas: the semantic web and the model checking. For this, we developed a tool, RDF2SPIN, which converts RDF graphs into SPIN language. This conversion aims checking the semantic graphs with the model checker SPIN in order to verify the consistency of the data. To illustrate our propos…