Bounding Resource Consumption with Gödel-Dummett Logics | Zendy

Dominique Larchey-Wendling | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Bounding Resource Consumption with Gödel-Dummett Logics

Author(s) -

Dominique Larchey-Wendling

Publication year - 2005

Publication title -

lecture notes in computer science

Language(s) - English

Resource type - Book series

SCImago Journal Rank - 0.249

H-Index - 400

eISSN - 1611-3349

pISSN - 0302-9743

ISBN - 3-540-30553-X

DOI - 10.1007/11591191_47

Subject(s) - bounding overwatch , bounded function , mathematics , resource (disambiguation) , consumption (sociology) , resource consumption , linear logic , integer (computer science) , discrete mathematics , process (computing) , transformation (genetics) , computer science , artificial intelligence , chemistry , philosophy , mathematical analysis , computer network , ecology , biochemistry , operating system , gene , biology , programming language , aesthetics

International audienceGödel-Dummett logic LC and its finite approximations LCn are the intermediate logics complete w.r.t. linearly ordered Kripke models. In this paper, we use LCn logics as a tool to bound resource consumption in some process calculi. We introduce a non-deterministic process calculus where the consumption of a particular resource denoted * is explicit and provide an operational semantics which measures the consumption of this resource.We present a linear transformation of a process P into a formula f of LC. We show that the consumption of the resource by P can be bounded by the positive integer n if and only if the formula f admits a counter-model in LCn. Combining this result with our previous results on proof and counter-model construction for LCn, we conclude that bounding resource consumption is (linearly) equivalent to searching counter-models in LCn

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research