Deterministic Automata for Unordered Trees

Autor: Boiret, Adrien, Hugot, Vincent, Niehren, Joachim, Treinen, Ralf

Publikováno v: EPTCS 161, 2014, pp. 189-202

Automata for unordered unranked trees are relevant for defining schemas and queries for data trees in Json or Xml format. While the existing notions are well-investigated concerning expressiveness, they all lack a proper notion of determinism, which

Externí odkaz: http://arxiv.org/abs/1408.5966

Automata for unordered trees

Autor: Boiret, Adrien, Hugot, Vincent, Niehren, Joachim, Treinen, Ralf

Publikováno v: In Information and Computation April 2017 253 Part 2:304-335

oMAC : Open Model for Automotive Cybersecurity

Autor: Hugot, Vincent, Jousse, Adrien, Toinard, Christian, Venelle, Benjamin

Publikováno v: escar Europe 2019
escar Europe 2019, Nov 2019, Stuttgart, Germany
17th escar Europe : embedded security in cars (Konferenzveröffentlichung)
17th escar Europe : embedded security in cars (Konferenzveröffentlichung), Nov 2019, Stuttgart, Germany. ⟨10.13154/294-6674⟩

International audience; Automotive architectures are constantly evolving to offer new features to end-users. Safety is critical, and cannot, in modern connected architectures, be achieved without strong cybersecurity. This paper proposes an advanced

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::777d3c0f34da7e37b856b0303aa1f27c
https://hss-opus.ub.ruhr-uni-bochum.de/opus4/frontdoor/index/index/docId/6674

Logics for Unordered Trees with Data Constraints on Siblings

Autor: Boiret, Adrien, Hugot, Vincent, Niehren, Joachim, Treinen, Ralf

Publikováno v: LATA : 9th International Conference on Language and Automata Theory and Applications
LATA : 9th International Conference on Language and Automata Theory and Applications, Mar 2015, Nice, France. pp.175-187

International audience; We study counting monadic second-order logics (CMso) for unordered data trees. Our objective is to enhance this logic with data constraints for comparing string data values attached to sibling edges of a data tree. We show tha

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::14c98a030e8082bd692ca5ecbb368e33
https://hal.inria.fr/hal-01088761/file/paper_78.pdf

Random Generation of Positive TAGEDs wrt. the Emptiness Problem

Autor: Heam, Pierre-Cyrille, Hugot, Vincent, Kouchnarenko, Olga

Publikováno v: [Research Report] RR-7441, INRIA. 2010, pp.43

Tree automata are a widely used formalism in Computer Science. Since their creation in the fifties, numerous more expressive extensions have been proposed. Unfortunately, the decision problems associated with these extensions are quite often undecida

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::7bbf1745cbe5dc6a437e32e57c296eb1
https://hal.inria.fr/inria-00531350/file/RR-7441.pdf