Search results for "formal"
showing 10 items of 1654 documents
Manufacturing, characterization and control of cell-based medicinal products: challenging paradigms toward commercial use
2015
During the past decade, a large number of cell-based medicinal products have been tested in clinical trials for the treatment of various diseases and tissue defects. However, licensed products and those approaching marketing authorization are still few. One major area of challenge is the manufacturing and quality development of these complex products, for which significant manipulation of cells might be required. While the paradigms of quality, safety and efficacy must apply also to these innovative products, their demonstration may be demanding. Demonstration of comparability between production processes and batches may be difficult for cell-based medicinal products. Thus, the development …
Co-simulation and Formal Verification of Co-operative Drone Control With Logic-Based Specifications
2021
Abstract Unmanned aerial vehicle (UAV) co-operative systems are complex cyber-physical systems that integrate a high-level control algorithm with pre-existing closed implementations of lower-level vehicle kinematics. In model-driven development, simulation is one of the techniques that are usually applied, together with testing, in the analysis of system behaviours. This work proposes a method and tools to validate the design of UAV co-operative systems based on co-simulation and formal verification. The method uses the Prototype Verification System, an interactive theorem prover based on a higher-order logic language, and the Functional Mock-up Interface, a widely accepted standard for co-…
The dual equivalence of equations and coequations for automata
2015
The transition structure α : X ? X A of a deterministic automaton with state set X and with inputs from an alphabet A can be viewed both as an algebra and as a coalgebra. We use this algebra-coalgebra duality as a common perspective for the study of equations and coequations. For every automaton ( X , α ) , we define two new automata: free ( X , α ) and cofree ( X , α ) representing, respectively, the greatest set of equations and the smallest set of coequations satisfied by ( X , α ) . Both constructions are shown to be functorial. Our main result is that the restrictions of free and cofree to, respectively, preformations of languages and to quotients A * / C of A * with respect to a congr…
A Formalism Supplementing Cognitive Semantics Based on Mereology
2007
ABSTRACT This paper is motivated by and aims to supplement Cognitive Semantics. Details of this latter prominent approach within contemporary linguistic research will not be discussed here. Rather, we focus on a formalization of the concept of Gestalt and provide a formal semantics that can be used to interpret a certain formal language (LM 0) with respect to a universe of structured wholes (Gestalts). Since a great deal of the analyses of linguistic organization that has been provided by Cognitive Semantics since the mid-1970s is based on the concept of Gestalt, the semantics unfolded in the following may be viewed as an attempt to provide a starting point for supplementing the yet informa…
On Referring to Gestalts
2010
This paper discusses a fresh approach to formal semantics based on mereology and Gestalt Theory. While Wiegand (2007, Spacial Cognition & Computation, Mahwah, NJ: Erlbaum) unfolds the technical details of this new approach, the following paper aims to discuss the philosophical motivation an implications of what I have called mereological semantics. Particular attention will be given to an ongoing debate on the nature of relations.
Putting information back into biological communication.
2010
At the heart of many debates on communication is the concept of information. There is an intuitive sense in which communication implies the transfer of some kind of information, probably the reason why information is an essential ingredient in most definitions of communication. However, information has also been an endless source of misunderstandings, and recent accounts have proposed that information should be dropped from a formal definition of communication. In this article, we re-evaluate the merits and the internal logic of information-based vs. information-free approaches and conclude that information-free approaches are conceptually incomplete and operationally hindered. Instead, we …
Languages with mismatches
2007
AbstractIn this paper we study some combinatorial properties of a class of languages that represent sets of words occurring in a text S up to some errors. More precisely, we consider sets of words that occur in a text S with k mismatches in any window of size r. The study of this class of languages mainly focuses both on a parameter, called repetition index, and on the set of the minimal forbidden words of the language of factors of S with errors. The repetition index of a string S is defined as the smallest integer such that all strings of this length occur at most in a unique position of the text S up to errors. We prove that there is a strong relation between the repetition index of S an…
Balance Properties and Distribution of Squares in Circular Words
2008
We study balance properties of circular words over alphabets of size greater than two. We give some new characterizations of balanced words connected to the Kawasaki-Ising model and to the notion of derivative of a word. Moreover we consider two different generalizations of the notion of balance, and we find some relations between them. Some of our results can be generalised to non periodic infinite words as well.
Co-learnability and FIN-identifiability of enumerable classes of total recursive functions
1994
Co-learnability is an inference process where instead of producing the final result, the strategy produces all the natural numbers but one, and the omitted number is an encoding of the correct result. It has been proved in [1] that co-learnability of Goedel numbers is equivalent to EX-identifiability. We consider co-learnability of indices in recursively enumerable (r.e.) numberings. The power of co-learnability depends on the numberings used. Every r.e. class of total recursive functions is co-learnable in some r.e. numbering. FIN-identifiable classes are co-learnable in all r.e. numberings, and classes containing a function being accumulation point are not co-learnable in some r.e. number…
Hamming, Permutations and Automata
2007
Quantum finite automata with mixed states are proved to be super-exponentially more concise rather than quantum finite automata with pure states. It was proved earlier by A.Ambainis and R.Freivalds that quantum finite automata with pure states can have exponentially smaller number of states than deterministic finite automata recognizing the same language. There was a never published "folk theorem" proving that quantum finite automata with mixed states are no more than superexponentially more concise than deterministic finite automata. It was not known whether the super-exponential advantage of quantum automata is really achievable. We prove that there is an infinite sequence of distinct int…