this ability in fuzzy uml, practically leaves the customers and market’s need without response in this important and vital area. here, the available sequence diagrams in fuzzy uml will map into fuzzy petri net. however, the formal models ability will be added to the semi-formal fuzzy uml. this formalization will add the automatic processing ability to the semi-formal fuzzy uml. further more, ...

By considering a permutation representation for meanders, semi-meanders, and stamp foldings we construct a new data structure that will allow us to extend the order of a given meander, semi-meander, or stamp folding in constant time. Then using this data structure, we develop a constant amortized time algorithm to generate all semi-meanders of order n. By maintaining the wind-factor for semi-me...

In this paper we extend the predicate logic introduced in [Beauquier et al. 2002] in order to deal with Semi-Markov Processes. We prove that with respect to qualitative probabilistic properties, model checking is decidable for this logic applied to SemiMarkov Processes. Furthermore we apply our logic to Probabilistic Timed Automata considering classical and urgent semantics, and considering als...

We study the problem of reasoning from incoherent answer set programs, i.e., from logic programs that do not have an answer set due to cyclic dependencies of an atom from its default negation. As a starting point we consider so-called semi-stable models which have been developed for this purpose building on a program transformation, called epistemic transformation. We give a model-theoretic cha...