Lattice-valued simulations for quantitative transition systems
نویسندگان
چکیده
منابع مشابه
LATTICE-VALUED CATEGORIES OF LATTICE-VALUED CONVERGENCE SPACES
We study L-categories of lattice-valued convergence spaces. Suchcategories are obtained by fuzzifying" the axioms of a lattice-valued convergencespace. We give a natural example, study initial constructions andfunction spaces. Further we look into some L-subcategories. Finally we usethis approach to quantify how close certain lattice-valued convergence spacesare to being lattice-valued topologi...
متن کاملα-Resolution Method for Lattice-valued Horn Generalized Clauses in Lattice-valued Propositional Logic Systems
In this paper, an α-resolution method for a set of lattice-valued Horn generalized clauses is established in lattice-valued propositional logic systemL P(X) based on lattice implication algebra. Firstly, the notions of lattice-valued Horn generalized clause, normal lattice-valued Horn generalized clause and unit latticevalued Horn generalized clause are given in L P(X). Then, the α-resolution o...
متن کاملQuantitative Modal Transition Systems
This extended abstract offers a brief survey presentation of the specification formalism of modal transition systems and its recent extensions to the quantitative setting of timed as well as stochastic systems. Some applications will also be briefly mentioned. 1 Modal Transition Systems: The Origines Modal transition systems [46] provids a behavioural compositional specification formalism for r...
متن کاملQuantitative Refinement for Weighted Modal Transition Systems
Specification theories as a tool in the development process of component-based software systems have recently attracted a considerable attention. Current specification theories are however qualitative in nature and hence fragile and unsuited for modern software systems. We propose the first specification theory which allows to capture quantitative aspects during the refinement and implementatio...
متن کاملModal Transition Systems: A Foundation for Three-Valued Program Analysis
We present Kripke modal transition systems (Kripke MTSs), a generalization of modal transition systems [27,26], as a foundation for three-valued program analysis. The semantics of Kripke MTSs are presented by means of a mixed power domain of states; soundness and consistency are proved. Two major applications, model checking partial state spaces and three-valued program shape analysis, are pres...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Approximate Reasoning
سال: 2015
ISSN: 0888-613X
DOI: 10.1016/j.ijar.2014.10.001