We present a model checking technique for LRT, a temporal logic for communicating sequential agents (CSAs) introduced by Lodaya, Ramanujam, and Thiagarajan. LRT contains temporal modalities indexed with a local point of view of one agent and allows to refer to properties of other agents according to the latest gossip which is related to local knowledge. The model checking procedure relies on a modularisation of LRT into temporal and gossip modalities. We introduce a hierarchy of formulae and a corresponding hierarchy of equivalences, which allows to compute for each formula and finite state distributed system a finite multi modal Kripke structure, on which the formula c...
The verification process of reactive systems in local model checking [BhatCleavelandGrum...
est generation has been acknowledged as a cost-prone activity reducing productivity and ...
AbstractCurrent approaches for analyzing timed systems are based on an explicit enumeration of the d...
AbstractA model checking algorithm for a variant of the temporal logic of causal knowledge [25] is g...
AbstractThe verification process of reactive systems in local model checking [1,7] and in explicit s...
Model-checking is a popular technique for verifying finite-state concurrent systems, the behaviour o...
Model checking is a method for formally verifying finite-state concurrent systems, conceived by Edmu...
National audienceIn this work, we begin by providing a general overview of the model-checking result...
Model checking is a technique for automatically verifying correctness properties of finite systems. ...
AbstractWe present aPCTL, a version of PCTL with an action-based semantics which coincides with the ...
AbstractAbstractReal-time finite-state systems may be specified in linear logic by means of linear i...
AbstractProof search in linear logic is known to be difficult: the provability of propositional line...
AbstractInterleaved models of computations limit the number of system components that can change sta...
AbstractWe show strict lower bounds for the complexity of several model checking problems for BPA (B...
AbstractWe present an algorithm for checking whether an infinite transition system, defined by a gra...
The verification process of reactive systems in local model checking [BhatCleavelandGrum...
est generation has been acknowledged as a cost-prone activity reducing productivity and ...
AbstractCurrent approaches for analyzing timed systems are based on an explicit enumeration of the d...
AbstractA model checking algorithm for a variant of the temporal logic of causal knowledge [25] is g...
AbstractThe verification process of reactive systems in local model checking [1,7] and in explicit s...
Model-checking is a popular technique for verifying finite-state concurrent systems, the behaviour o...
Model checking is a method for formally verifying finite-state concurrent systems, conceived by Edmu...
National audienceIn this work, we begin by providing a general overview of the model-checking result...
Model checking is a technique for automatically verifying correctness properties of finite systems. ...
AbstractWe present aPCTL, a version of PCTL with an action-based semantics which coincides with the ...
AbstractAbstractReal-time finite-state systems may be specified in linear logic by means of linear i...
AbstractProof search in linear logic is known to be difficult: the provability of propositional line...
AbstractInterleaved models of computations limit the number of system components that can change sta...
AbstractWe show strict lower bounds for the complexity of several model checking problems for BPA (B...
AbstractWe present an algorithm for checking whether an infinite transition system, defined by a gra...
The verification process of reactive systems in local model checking [BhatCleavelandGrum...
est generation has been acknowledged as a cost-prone activity reducing productivity and ...
AbstractCurrent approaches for analyzing timed systems are based on an explicit enumeration of the d...