Canada Spends Logo

Explorez notre analyse du budget 2026

Grant: Discovery Grants Program - Individual

McMaster University

$24,000.00

Concurrency and Approximate Reasoning

EF 2023-24

Résumé
The project deals with two subjects, first involves `concurrency', the second `approximate reasoning'. Concurrent 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 and approximate reasoning. Our general aim is to develop a framework, based on the concept of `generalized causality' modelled by `discrete relational structures' and `generalized traces' (both proposed by Janicki and Koutny), to support the design and the verification of sophisticated concurrent systems. When empirical data are represented as some formal structures, the outcome may not have all required properties. For example any ranking relations should at least be a partial order, but a relation obtained by various subjective judgments may include cycles. The problem is how to find the `best approximation' of a given structure by a structure with specific properties. While `rough sets' handle lower and upper approximations exceptionally well, `optimal' and `structural' (i.e. having desired special properties) approximations are much less developed. We plan to develop a family of abstract metrics that can be used for various classes of sets, relational structures and properties. Moreover, we want to simulate the concept of a metric by a sequence of `lower' and `upper' approximations that preserve the desired properties (in both the standard theory of relations and rough sets settings). In both cases finding some efficient algorithms and supporting software is a long term ultimate goal.
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
RGPIN-2020-05715
Name nom
Janicki, Ryszard
Department département
Computing and Software - 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
2023
Competition year année de concours
2020
Award amount
24000
Program id
RGPIN
Program name en
Discovery Grants Program - Individual
Program name fr
Programme de subventions à la découverte - individuelles
Group en
DISCOVERY RESEARCH
Group fr
RECHERCHE AXÉE SUR LA DÉCOUVERTE
Committee code
1507
Committee name en
Computer Science
Committee name fr
Sciences informatiques
Area of application code
802
Area of application group en
Information and communication services
Area of application group fr
Services d'information et de télécommunications
Area of application en
Information systems and technology
Area of application fr
Systèmes d'information et technologie de l'information
Research subject code
2960
Research subject group en
Applied mathematics
Research subject group fr
Mathematical modelling
Research subject en
Mathématiques appliquées
Research subject fr
Modélisation mathématique
Application title
Concurrency and Approximate Reasoning
Keyword
abstract and algebraic approximation; approximate reasoning; concurrency theory; interval orders; models of concurrency; Petri nets; rough sets; similarity
Application summary
The project deals with two subjects, first involves `concurrency', the second `approximate reasoning'. Concurrent 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 and approximate reasoning. Our general aim is to develop a framework, based on the concept of `generalized causality' modelled by `discrete relational structures' and `generalized traces' (both proposed by Janicki and Koutny), to support the design and the verification of sophisticated concurrent systems. When empirical data are represented as some formal structures, the outcome may not have all required properties. For example any ranking relations should at least be a partial order, but a relation obtained by various subjective judgments may include cycles. The problem is how to find the `best approximation' of a given structure by a structure with specific properties. While `rough sets' handle lower and upper approximations exceptionally well, `optimal' and `structural' (i.e. having desired special properties) approximations are much less developed. We plan to develop a family of abstract metrics that can be used for various classes of sets, relational structures and properties. Moreover, we want to simulate the concept of a metric by a sequence of `lower' and `upper' approximations that preserve the desired properties (in both the standard theory of relations and rough sets settings). In both cases finding some efficient algorithms and supporting software is a long term ultimate goal.