We consider the problem of model checking modular Petri nets for the linear time logic LTL-X. An algorithm is presented which can use the synchronisation graph from modular analysis as presented by Christensen and Petrucci and perform LTL-X model checking. We have implemented our method in the reachability analyser Maria and performed experiments. As is the case for modular analysis in general,...

The paper focuses on practical analyses for logic programs with delay. The method described is for downward-closed program properties and, in particular, groundness.A program transformation is defined which eliminates the delay statements but still enables an accurate approximation of the behaviour of delayed goals to be traced by the analyser. A simple prototype implementation has been built a...

We describe our linguistic rule-based tagger IceTagger, and compare its tagging accuracy to the TnT tagger, a state-of-theart statistical tagger, when tagging Icelandic, a morphologically complex language. Evaluation shows that the average tagging accuracy is 91.54% and 90.44%, obtained by IceTagger and TnT, respectively. When tag profile gaps in the lexicon, used by the TnT tagger, are filled ...

Static analyses based on denotational semantics can naturally model functional behaviours of the code in a compositional and completely context and flow sensitive way. But they only model the functional i.e., input/output behaviour of a program P , not enough if one needs P ’s internal behaviours i.e., from the input to some internal program points. This is, however, a frequent requirement for ...

A finite-state, rule-based morphological analyser is presented here, within the framework of machine translation system TAVAL. This morphological analyser introduces specific features which are particularly useful for translation, such as the detection and morphological tagging of word groups that act as a single lexical unit for translation purposes. The case where words in one such group are ...

The Tyrolean Complexity Tool, TCT for short, is an open source complexity analyser for term rewrite systems. Our tool TCT features a majority of the known techniques for the automated characterisation of polynomial complexity of rewrite systems and can investigate derivational and runtime complexity, for full and innermost rewriting. This system description outlines features and provides a shor...

In this paper, we present an approach to non-termination of term rewriting systems inspired by a technique that was designed in the context of logic programming. Our method is based on a classical unfolding operation together with semi-unification and is independent of a particular reduction strategy. We also describe a technique to reduce the explosion of rules caused by the unfolding process....

Semantic web service composition constitutes the phases namely specification, matchmaking, planning, validation, discovery and execution. As web service composition is categorised as an AI planning problem, the objective of this paper is to propose a fluent calculus approach for the planning phase of the semantic web service composition. Among various methods to solve the AI planning problem, l...

BACKGROUND Nasal nitric oxide (nNO) levels are very low in primary ciliary dyskinesia (PCD) and it is used as a screening test. METHODS We assessed the reliability and usability of a hand-held analyser in comparison to a stationary nitric oxide (NO) analyser in 50 participants (15 healthy, 13 PCD, 22 other respiratory diseases; age 6-79 years). Nasal NO was measured using a stationary NO anal...