this article proposes composition of fuzzy sets theory with discrete-event simulation and puts it into application in order to model uncertain activity duration in simulating a real-world system. the purpose of this paper is to assess the usefulness of fuzzy simulation for modeling uncertain activity duration, especially when insufficient or no sample data is available. in this research, fuzzy ...

this study considers an eoq inventory model with advance payment policy in a fuzzy situation by employing two types of fuzzy numbers that are trapezoidal and triangular. two fuzzy models are developed here. in the first model the cost parameters are fuzzified, but the demand rate is treated as crisp constant. in the second model, the demand rate is fuzzified but the cost parameters are treated ...

Building on the fact that descriptive frames are coalgebras for the Vietoris functor on the category of Stone spaces, we introduce and study the concept of a Vietoris bisimulation between two descriptive modal models, together with the associated notion of bisimilarity. We prove that our notion of bisimilarity, which is defined in terms of relation lifting, coincides with Kripke bisimilarity (w...

Abstract We study a generalization of the notion conservativity spectrum an arithmetical theory to language with transfinitely many truth definitions. establish natural correspondence spectra and points special Kripke model introduced studied by D. Fernández–Duque J. Joosten. For iterated reflection principles over theories definitions we also conservation results analogous well-known Schmerl f...

In this paper we consider the problem of computing and representing the bisimulation on a given Kripke structure. Such a problem, central in Model Checking, has been tackled by many authors and various solutions have been given. In particular, the algorithm proposed by Kanellakis and Smolka [7] is used in many model checkers with explicit-state representation, while the algorithm proposed by Bo...

The Brouwer-Heyting-Kolmogorov interpretation of intuition-istic logic suggests that p q can be interpreted as a computation that given a proof of p constructs a proof of q. Dually, we show that every nite canonical model of q contains a nite canonical model of p. If q and p are interderivable, their canonical models contain each other. Using this insight, we are able to characterize validity i...

In this course, we have seen several modal logics and proof calculi to justify the truth / validity of formulas. But natural deduction, Hilbert-style calculi, tableaux, sequent calculi and the like are not the only way to establish truth. For a particular Kripke structure at hand, a systematic exploration of the state space can be used to establish if a formula of modal logic is true or false i...

We develop possible worlds (Kripke) semantics at the categorical abstract model theoretic level provided by the so-called ‘institutions’. Our general abstract modal logic framework provides a method for systematic Kripke semantics extensions of logical systems from computing science and logic. We also extend the institution-independent method of ultraproducts of [R. Diaconescu, Institution-inde...

A class of Kripke frames is called modally definable if there is a set of modal formulas such that the class consists exactly of frames on which every formula from that set is valid, i. e. globally true under any valuation. Here, existential definability of Kripke frame classes is defined analogously, by demanding that each formula from a defining set is satisfiable under any valuation. This is...