Displaying 101 – 120 of 141

Showing per page

An specification language for fuzzy systems.

Francisco José Moreno-Velo, Santiago Sánchez-Solano, Angel Barriga, M.ª Iluminada Baturone, Diego R. López (2001)

Mathware and Soft Computing

This work presents the main features of XFL3, a language for fuzzy system specification, which has been defined as the common description languaje for the tools forming the Xfuzzy 3.0 development environment. Its main advantages are its capability to admit user-defined membership functions, parametric operators, and linguistic hedges. A brief summary of the tools included in Xfuzzy 3.0 and an example illustrating the use of XFL3 are also included.

An upper bound for transforming self-verifying automata into deterministic ones

Ira Assent, Sebastian Seibert (2007)

RAIRO - Theoretical Informatics and Applications

This paper describes a modification of the power set construction for the transformation of self-verifying nondeterministic finite automata to deterministic ones. Using a set counting argument, the upper bound for this transformation can be lowered from 2 n to O ( 2 n n ) .

Approximate Model Checking of Real-Time Systems for Linear Duration Invariants

Choe, Changil, O., Hyong-Chol, Han, Song (2013)

Serdica Journal of Computing

Real-time systems are usually modelled with timed automata and real-time requirements relating to the state durations of the system are often specifiable using Linear Duration Invariants, which is a decidable subclass of Duration Calculus formulas. Various algorithms have been developed to check timed automata or real-time automata for linear duration invariants, but each needs complicated preprocessing and exponential calculation. To the best of our knowledge, these algorithms have not been implemented....

Asymptotic behaviour of bi-infinite words

Wit Foryś (2004)

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications

We present a description of asymptotic behaviour of languages of bi-infinite words obtained by iterating morphisms defined on free monoids.

Asymptotic behaviour of bi-infinite words

Wit Foryś (2010)

RAIRO - Theoretical Informatics and Applications

We present a description of asymptotic behaviour of languages of bi-infinite words obtained by iterating morphisms defined on free monoids.

Asynchronous sliding block maps

Marie-Pierre Béal, Olivier Carton (2000)

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications

Asynchronous sliding block maps

Marie-Pierre Béal, Olivier Carton (2010)

RAIRO - Theoretical Informatics and Applications

We define a notion of asynchronous sliding block map that can be realized by transducers labeled in A* × B*. We show that, under some conditions, it is possible to synchronize this transducer by state splitting, in order to get a transducer which defines the same sliding block map and which is labeled in A × Bk, where k is a constant integer. In the case of a transducer with a strongly connected graph, the synchronization process can be considered as an implementation of an algorithm of...

Currently displaying 101 – 120 of 141