Search results for "Formal languages"
showing 10 items of 322 documents
The double-incompleteness theorem
1976
Let T be a strong enough theory, and M - its metatheory, both are consistent. Then there is a closed arithmetical formula H that is undecidable in T, but one cannot prove in M neither that H is T-unprovable, nor that H is T-unrefutable. For English translation and proof, see K. Podnieks What is mathematics: Godel's theorem and around.
Some Algebraic Properties of Machine Poset of Infinite Words
2008
The complexity of infinite words is considered from the point of view of a transformation with a Mealy machine that is the simplest model of a finite automaton transducer. We are mostly interested in algebraic properties of the underlying partially ordered set. Results considered with the existence of supremum, infimum, antichains, chains and density aspects are investigated.
Deciding properties of integral relational automata
1994
This paper investigates automated model checking possibilities for CTL* formulae over infinite transition systems represented by relational automata (RA). The general model checking problem for CTL* formulae over RA is shown undecidable, the undecidability being observed already on the class of Restricted CTL formulae. The decidability result, however, is obtained for another substantial subset of the logic, called A-CTL*+, which includes all ”linear time” formulae.
Minimal Büchi Automata for Certain Classes of LTL Formulas
2009
In this paper we calculate the minimal number of states of Buchi automata which encode some classes of linear temporal logic (LTL) formulas that are frequently used in model checking. Our results may be used for verification of the quality of algorithms which automatically translate LTL formulas into Buchi automata and for improving the quality and speed of such translators. In the last section of this paper we compare our lower-bound estimations to Buchi automata generated by two currently used translators: LTL2BA and SPOT.
Star-free trace languages
1992
Abstract Generalizing a classical result of Schutzenberger to free partially commutative monoids, we prove that the family of star-free trace languages coincides with the family of aperiodic trace languages.
A description based on languages of the final non-deterministic automaton
2014
The study of the behaviour of non-deterministic automata has traditionally focused on the languages which can be associated to the different states. Under this interpretation, the different branches that can be taken at every step are ignored. However, we can also take into account the different decisions which can be made at every state, that is, the branches that can be taken, and these decisions might change the possible future behaviour. In this case, the behaviour of the automata can be described with the help of the concept of bisimilarity. This is the kind of description that is usually obtained when the automata are regarded as labelled transition systems or coalgebras. Contrarily t…
Real-Time Vector Automata
2013
We study the computational power of real-time finite automata that have been augmented with a vector of dimension k, and programmed to multiply this vector at each step by an appropriately selected k×k matrix. Only one entry of the vector can be tested for equality to 1 at any time. Classes of languages recognized by deterministic, nondeterministic, and "blind" versions of these machines are studied and compared with each other, and the associated classes for multicounter automata, automata with multiplication, and generalized finite automata.
Ontology Views for Ontology Change Management
2014
International audience; In the literature, ontology change management systems (OCMS) are direct implementation of the concept of “change management” stated by reference (Klein, 2004). Ontology change management combines ontol- ogy evolution and versioning features to manage ontol- ogy changes and their impacts. Since 2007, many works have combined ontology evolution and versioning into ontology change management systems (OCMS). The evolution subject has been massively studied in these works. They especially addressed the consistence issue for the application of changes on the ontology. These proposals constituted a consequent background for ontology change management but they did not take i…
Modeling Changes for SHOIN(D) Ontologies: An Exhaustive Structural Model
2013
Ontology development starts with a rigorous ontological analysis that provides a conceptualization of the domain to model agreed by the community. An ontology, specified in a formal language, approximates the intended models of this conceptualization. It needs then to be revised and refined until an ontological commitment is found. Also ulterior updates, responding to changes in the domain and/or the conceptualization, are expected to occur throughout the ontology life cycle. To handle a consistent application of changes, a couple of ontology evolution methodologies have been proposed. Maintaining the structural consistency is one of the ontology evolution criteria. It implies modeling chan…
"Table 5" of "Measurement of exclusive $\gamma\gamma\rightarrow \ell^+\ell^-$ production in proton-proton collisions at $\sqrt{s} = 7$ TeV with the A…
2015
Acoplanarity (ACO) distributions unfolded for detector resolution, and lepton pair trigger, reconstruction and identification efficiencies for e+ e- channel (empty bins are not reported).