Generic Trace Logics

We combine previous work on coalgebraic logic with the coalgebraic traces semantics of Hasuo, Jacobs, and Sokolova

Inventur mit RFID- Handlesegeräten: Erfahrungsberichte über die Durchführung von Inventurarbeiten mit Hilfe von RFID- Handlesegeräten

Kissig J, Köhler D. Inventur mit RFID- Handlesegeräten: Erfahrungsberichte über die Durchführung von Inventurarbeiten mit Hilfe von RFID- Handlesegeräten. In: Seeliger F, Gillert F, Buschhart C, eds. RFID für Bibliothekare : ein Vademecum. 3rd ed. Berlin: News & Media; 2014: 117-135.Dieses Kapitel behandelt das Thema der RFID-gestützen Revisionsarbeiten in Bibliotheken anhand zweier Beispiele und zeigt auch selbstentwickelte Ansätze auf, die die Durchführung der Arbeiten effizienter gestalten. Im Grundlagenteil werden die verschiedenen Voraussetzungen für Inventuren mit RFID beschrieben: der Listenim- und export aus dem Bibliotheksmanagementsystem, das Handling der Handlesesgeräte sowie der Transponderposition im Buch. Am Beispiel der Bibliothek der TH Wildau werden ältere Ergebnisse von Testinventuren aus 2008 mit aktuellen Tests aus 2011 verglichen. Eine eigene Inventur-Software und die Nutzung der transponderspezifischen Seriennummer als Mediennummernersatz werden hierbei eine Rolle spielen. Am Beispiel der Universitätsbibliothek Bielefeld wird die Entwicklung eines Revisionstools, in Kooperation mit der Firma Bibliotheca RFID, sowie deren Testergebnisse und der Echtbetrieb beschrieben

Trace semantics via determinization

This paper takes a fresh look at the topic of trace semantics in the theory of coalgebras. The first development of coalgebraic trace semantics used final coalgebras in Kleisli categories, stemming from an initial algebra in the underlying category (see notably~\cite{HasuoJS07}). This approach requires some non-trivial assumptions, like dcpo enrichment, which do not always hold, even in cases where one can reasonably speak of traces (like for weighted automata). More recently, it has been noticed (see~\cite{SBBR10}) that trace semantics can also arise by first performing a determinization construction. In this paper, we develop a systematic approach, in which the two approaches correspond to different orders of composing a functor and a monad, and accordingly, to different distributive laws. The relevant final coalgebra that gives rise to trace semantics does not live in a Kleisli category, but more generally, in a category of Eilenberg-Moore algebras. In order to exploit its finality, we identify an extension operation, that changes the state space of a coalgebra into a free algebra, which abstractly captures determinization of automata. Notably, we show that the two different views on trace semantics are equivalent, in the examples where both approaches are applicable.We are grateful to the anonymous referees for valuable comments. The work of Alexandra Silva is partially funded by the ERDF through the Programme COMPETE and by the Portuguese Foundation for Science and Technology, project Ref. FCOMP-01-0124-FEDER-020537 and SFRH/BPD/71956/2010

Finitary Logics for Coalgebras with Branching

The purpose of this dissertation is to further previous work on coalgebras as infinite statebased transition systems and their logical characterisation with particular focus on infinite regular behaviour and branching. Finite trace semantics is well understood [DR95] for nondeterministic labelled transition systems, and has recently [Jac04, HJS06] been generalised to a coalgebraic level where monads act as branching types for instance, of nondeterministic choice. Finite trace semantics then arises through an inductive construction in the Kleisli-category of the monad. We provide a more comprehensive definition of finite trace semantics, allowing for finitary branching types in Chapter 5. In Chapter 6 we carry over the ideas behind our definition of finite trace semantics to define infinite trace semantics. Coalgebraic logics [Mos99] provide one approach to characterising states in coalgebras up to bisimilarity. Coalgebraic logics are Boolean logics with the modality r. We define the Boolean dual of r in the negation-free fragment of finitary coalgebraic logics in Chapter 7, showing that finitary coalgebraic logics are essentially negation free. Our proof is largely based on the previously established completeness of finitary coalgebraic logics [KKV08]. Finite trace semantics induces the notion of finite trace equivalence. In Chapter 8 we define coalgebraic logics for many relevant branching and transition types characterising states of coalgebras with branching up to finite trace equivalence. Under further assumptions we show that these logics are expressive. Coalgebra automata allow us to state finitary properties over infinite structures essentially by a fix-point style construction. We use the dualisation of r from Chapter 7 to prove that coalgebra automata are closed under complementation in Chapter 10. This result completes a Rabin style [Rab69] correspondence between finitary coalgebraic logics and coalgebra automata for finitary transition types, begun in [Ven04, KV05]. The semantics of coalgebra automata is given in terms of parity graph games [GTW02]. In Chapter 9 we show how to structure parity graph games into rounds using the notion of players power [vB02] and how to normalise the interaction pattern between the players per round. From the latter we obtain the coinductive principle of game bisimulation. Languages accepted by coalgebra automata are called regular. Regularity is commonly [Sip96, HMU03] disproved using the pumping lemma for regular languages. We define regular languages of coalgebras and prove a pumping lemma for these languages in Chapter 11

New RFID-apps: HF-Based Stock Management by Mobile Solution and Producing Usage Statistics on Non-Lending Colleges (e.g. Periodicals)

With this contribution we will provide an outline on new applications of RFID-utilization which go beyond the typical applications such as self-check service to clients and security tasks and may give a perspective of new ideas. The German market of RFID-related tenders in the library context has an annual value of estimated at ten million Euro on average. It is our belief that innovative ideas and insights from within the library world itself are needed to advance the technological support and improve our goals, services and workflows in the small and smart world of the internet of things. Against the background that our University of Applied Sciences is not so far from the Funkerberg where the first radio programme was transmitted in Germany in the year 1920 and that some RFID-related degree courses like Telematics, Logistics and Informatics are offered, it is proud to maintain the only RFID-task group in Germany which is strongly connected with the library-matters1 and can present two contributions during this conference. At first we will describe our inventory workflow with mobile RFID-devices, wands and software to get real time information about the existing holding and its position, which is important for every library to monitor its asset and all visualisations and indications of online-catalogue information like the location of each copy.2 We have different ways of reaching this goal, e.g. through the Unique Identifier (UID) as serial numer of each tag which identifies the transponder and has under the point of view of security aspects further advantages. Our team has achieved with this method a detection rate of 98 percent. Through scanning the media shelves with an RFID working mobile device (which includes antenna and reader) we got in a relatively short time (average of less than 10 minutes for 1.500 RFID-tags or items) a good part of the library sock. The UID is deposited within the Integrated Library System (ILS) or Library Management System (LMS) of the public libraries in Berlin with almost hundred locations. In a broader audience we would like to discuss and share our experience. As a second example we will present our solution to measure the usage of RFID-tagged printed-journals on a movable shelf. This shelf is fitted with an RFID-Reader, adapted single-loop antenna and some other smart units, a rechargeable battery, also a bluetooth transmitter to deliver all data to bluetooth-receiving personal computer. In this notebook a special unique software is used as middleware with a program that produces different charts about the usage of each shelved current journal. The electromagnetic field near this shelf enables recording how often the journal has been removed and replaces. With this solution as a first step we hope to get more information about the usage of non-lending materials within a library, not only journals

Introducing Modal Fixed Point Operators into CCSL

CCSL (short for Coalgebraic Class Specification Language) is a formal specification language, developed jointly at the university of Nijmegen and at TU Dresden. CCSL permits to specify the interface of classes of object-oriented languages by declaring their methods with argument and result types. Further, it is possible to restrict the behaivior of the methods with a special form of higher order logic. The master thesis of Jan Rothe enhanced the logic of CCSL with the (infinitary) modal operators Box and Diamond. Assignment: The aim of this project is to enrich CCSL with arbitrary modal fixedpoint operators as they are known from the µ-calculus. For this it is necessary: 1. To extend CCSL’s logic such that one can express formulas from the modal µ–calculus in it. The extention can also been done in the form of “syntactic sugar”. 2. To describe a semantics for the new syntax. 3. To develop an example specification that demonstrates the usefulness of the new operators