Extensions of Partial Structures and Their Application to Modelling of Multiagent Systems

Staruch, Bożena

doi:10.1007/3-540-32370-8_22

Cited by 1 publication

(1 citation statement)

References 2 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…-Conceptually closely related earlier works are: [21], proposing the use of partial structures to model multi-agent systems where the agents possess only partial information, gradually completed as the knowledge grows, and [22], taking an algebraic approach to the completion of partial first-order models, again representing partial information about the actual world. -A technique called 'partial model checking' was introduced in [2] (see also, [3], [12]) for verifying concurrent systems by gradually removing concurrent components and then reducing the specification, until completely checked, in order to avoid the state explosion problem.…”

Section: Introductionmentioning

confidence: 99%

Model checking and model synthesisfrom partial models: a logic-based perspective

Goranko

2020

Preprint

View full text Add to dashboard Cite

I consider the following generic scenario: an abstract model M of some 'real' system is only partially presented, or partially known to us, and we have to ensure that the actual system satisfies a given specification, formalised in some logical language. This scenario has at least two essentially different interpretations, leading to two, essentially different, formal logical and algorithmic problems: "Model Synthesis from Partial Models", where some 'admissible' extension of M to a full model must satisfy the specification, and "Model Checking of Partial Models", where all 'admissible' extensions of M to a full model must satisfy the specification. These problems naturally extend the classical logical decision problems of Satisfiability, Validity, and Model Checking. Here I briefly discuss both problems in the contexts of classical, modal and temporal logics. I make some observations, state some open questions, and outline a general tableaux-style procedure that solves the problem of unconstrained model synthesis from finite partial models for several well-known modal and temporal logics, incl. K, LTL, CTL, ATL.

show abstract

Section: Introductionmentioning

confidence: 99%

Model checking and model synthesisfrom partial models: a logic-based perspective

Goranko

2020

Preprint

View full text Add to dashboard Cite

show abstract

Extensions of Partial Structures and Their Application to Modelling of Multiagent Systems

Cited by 1 publication

References 2 publications

Model checking and model synthesisfrom partial models: a logic-based perspective

Model checking and model synthesisfrom partial models: a logic-based perspective

Contact Info

Product

Resources

About