Canada Spends Logo

Explorez notre analyse du budget 2026

Grant: Discovery Grants Program - Individual

McMaster University

$20,000.00

Concurrency theory, non-numerical approximation and mereology

EF 2011-12

Résumé
Both concurrent systems, approximation problems and mereological systems abound in human experience but their fully adequate conceptualization as yet eludes us. Our increasing dependence on ever more complex systems in the management and control of human affairs and activities increases the urgency for developing more adequate and preferable more formal concepts to maintain reliable control over systems we have created. The solution of the problem of correct specification of the design and verification of its behaviour becomes crucial, and a satisfactory conceptual apparatus for rigorous specification and verification becomes essential. The project will explore theoretical issues involved in the formal reasoning about concurrent systems, approximate reasoning, and mereological systems. First general aim is to develop a framework, based on the concept of Generalized Causality modelled by Discrete Relational Structures (developed by Janicki and Koutny), to support the design and the verification of sophisticated concurrent systems. The second general aim is to strengthen foundations and improve applications of non-numerical approximation and non-numerical ranking techniques. The third aim is to provide a solid formal mereological reasoning that can effectively be used in Software Engineering and Computer Science. What connects all three topics is methodology, as the scientific method is basically the same, i.e., discrete mathematics, especially set, relation and automata theory and of course formal logic.
Programme
Discovery Grants Program - Individual
Bénéficiaire
Emplacement
Ontario, Canada
Type de bénéficiaire
Academia
Type
Grant
Source
NSERC's Awards Data

Tel que publié

Application id
36539-2010
Name nom
Janicki, Ryszard
Department département
Computing and Software
Organization id
27
Institution établissement
McMaster University
Province en
Ontario
Province fr
Ontario
Country en
CANADA
Country fr
CANADA
Fiscal year exercice financier
2011
Competition year année de concours
2010
Award amount
20000
Program id
RGPIN
Program nane en
Discovery Grants Program - Individual
Program name fr
Programme de subventions à la découverte - individuelles
Group en
Discovery grants programs
Group fr
Programmes de subventions à la découverte
Committee code
1507
Committee name en
Computer Science
Committee name fr
Sciences informatiques
Area of application code
1205
Area of application group en
Advancement of knowledge
Area of application group fr
Avancement des connaissances
Area of application en
Mathematical sciences
Area of application fr
Sciences mathématiques
Research subject code
2712
Research subject group en
Information technology
Research subject group fr
Technologie de l'information
Research subject en
Theory of computation
Research subject fr
Théorie de calcul
Partie
2
Nb partie
5
Application title
Concurrency theory, non-numerical approximation and mereology
Keyword
NSERC
Application summary
Both concurrent systems, approximation problems and mereological systems abound in human experience but their fully adequate conceptualization as yet eludes us. Our increasing dependence on ever more complex systems in the management and control of human affairs and activities increases the urgency for developing more adequate and preferable more formal concepts to maintain reliable control over systems we have created. The solution of the problem of correct specification of the design and verification of its behaviour becomes crucial, and a satisfactory conceptual apparatus for rigorous specification and verification becomes essential. The project will explore theoretical issues involved in the formal reasoning about concurrent systems, approximate reasoning, and mereological systems. First general aim is to develop a framework, based on the concept of Generalized Causality modelled by Discrete Relational Structures (developed by Janicki and Koutny), to support the design and the verification of sophisticated concurrent systems. The second general aim is to strengthen foundations and improve applications of non-numerical approximation and non-numerical ranking techniques. The third aim is to provide a solid formal mereological reasoning that can effectively be used in Software Engineering and Computer Science. What connects all three topics is methodology, as the scientific method is basically the same, i.e., discrete mathematics, especially set, relation and automata theory and of course formal logic.