Abstract
We study hybrid automata from a coalgebraic point of view. We show that such a perspective supports a generic theory of hybrid automata with a rich palette of definitions and results. This includes, among other things, notions of bisimulation and behaviour, state minimisation techniques, and regular expression languages.

Abstract
Regulations, laws, norms, and other documents of legal nature are a relevant part of any governmental organisation. During digitisation and transformation stages towards a digital government model, information and communication technologies are explored to improve internal processes and working practices of government infrastructures. This paper introduces preliminary results on a research line devoted to developing visualisation techniques for enhancing the readability and comprehension of legal texts. The content of documents is conveyed to a well-defined model, which is enriched with semantic information extracted automatically. Then, a set of digital views are created for document exploration from both a structural and semantic point of view. Effective and easier to use digital interfaces can enable and promote citizens engagement in decision-making processes, provide information for the public, and also enhance the study and analysis of legal texts by lawmakers, legal practitioners, and assorted scholars. © 2018 Copyright is held by the owner/author(s). Publication rights licensed to ACM.

Abstract
A Community of Practice (CoP) allows practitioners of a clearly defined domain to share knowledge, experience, and best practices. It provides a social context for practitioners, often distributed across multiple organizations, and emerged over the last few decades as a fundamental mechanism for knowledge sharing, management, and generation within organizations. Best practices, innovations, and solutions to shared problems first emerge within CoPs. These are, and must be perceived as, an investment in organizations' future and competitiveness. Establishing a CoP is a straightforward process, the most challenging factor being the recruitment of members to attain critical mass. The challenge is to maintain the CoP active, with members contributing with high quality, innovative content. Increasing a CoP's medium / long-term survival probabilities requires careful planning to avoid incurring in some well-known pitfalls. This paper proposes and discusses a set of nine guidelines for establishing and maintaining a community of practice within the context of Electronic Governance (EGOV) and Government Chief Information Officers (GCIO). This research was motivated by the initiative of the government of a developing country. Results are based on a review of the relevant literature, together with the detailed analysis of interviews to members or coordinators of large communities of practice. This analysis was further validated against the opinions of public servants directly involved on EGOV-GCIO-related functions during two focus groups meetings. © 2018 Association for Computing Machinery.

Abstract
The structure of a reactive transition system can to be modified on the fly by e.g. removing, reversing or adding new transitions. The topic has been studied by D. Gabbay and his collaborators in different contexts. In this paper we take their work a step further, introducing a suitable notion of bisimulation and obtaining a Hennessy-Milner theorem with respect to a hybrid logic in which transition properties can be expressed. Our motivation is to provide a characterisation of equivalence for such systems in order to exploit their possible roles in the formal description of software connectors in Reo, either from a behavioural (semantic) or spatial (syntactic) point of view.

Abstract
Quantum algorithmics is emerging as a hot area of research, with the potential to have groundbreaking impacts on many different fields. The benefits come at a high price, however: quantum programming is hard and finding new quantum algorithms is far from straightforward. This area of research may greatly benefit from mathematical foundations and calculi, capable of supporting algorithm development and analysis. The Quantum Algorithmics Agenda at QuantaLab is contributing by seeking a suitable semantics-calculus-logic trilogy for quantum computation.

Abstract
We introduce HHL, a hierarchical variant of hybrid logic. We study first order correspondence results and prove a Hennessy-Milner like theorem relating (hierarchical) bisimulation and modal equivalence for HHL. Combining hierarchical transition structures with the ability to refer to specific states at different levels, this logic seems suitable to express and verify properties of hierarchical transition systems, a pervasive semantic structure in Computer Science.