<?xml version="1.0" encoding="UTF-8"?><xml><records><record><source-app name="Biblio" version="6.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Alexandre Madeira</style></author><author><style face="normal" font="default" size="100%">Renato Neves</style></author><author><style face="normal" font="default" size="100%">Luis Soares Barbosa</style></author><author><style face="normal" font="default" size="100%">M. Martins</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Logics for robotics?</style></title><secondary-title><style face="normal" font="default" size="100%">AIP Conference Proceedings</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2014</style></year></dates><urls><related-urls><url><style face="normal" font="default" size="100%">https://haslab.uminho.pt/sites/default/files/madeira/files/madeiranevesmartinsbarbosa.pdf</style></url></related-urls></urls><abstract><style face="normal" font="default" size="100%">&lt;p&gt;This paper introduces HHL, a hierarchical variant of hybrid logic. First-order correspondence and a Hennessy-Milner like theorem relating (hierarchical) bisimulation and logical equivalence for HHLare presented. Combining hierarchical transition structures with the ability to refer to specic states at any level of description, this logic seems suitable to express and verify properties of hierarchical transition systems, a pervasive semantic structure in Computer Science.&lt;/p&gt;
</style></abstract></record></records></xml>