In this report we introduce modal specifications, a new object dedicated to specify some branching-time properties for systems. Modal specifications are a useful tool for studying Petri net synthesis although this aspect is not presented here. The main purpose of this report is to establish the equivalence between a syntactic fragment of the Mu-calculus, namely the conjunctive Nu-calculus and modal specifications. We give the algorithm for constructing a conjunctive Nu-calculus sentence equivalent to a modal specification and the converse. We also study the structure of the set of models of a modal specification
AbstractFor some modal fixed point logics, there are deductive systems that enjoy syntactic cut-elim...
Modal automata are a classic formal model for component-based systems that comes equipped with a ric...
Dans ce travail nous étudions la complexité de certains fragments du mu-calcul selon deux points de ...
In this report we introduce modal specifications, a new object dedicated to specify some branching-t...
International audienceWe introduce a new notion of structural refinement, a sound abstraction of log...
There are two fundamentally different approaches to specifying and verifying properties of systems. ...
We briefly survey the background and history of modal and temporal logics. We then concentrate on th...
The modal mu-calculus is an extension of modal logic with two operators mu and ni, which give the le...
In this paper we present a modal logic for describing properties of terms in the object calculus of ...
IspCal is a formal language well suited for describing synchronous digital systems, and it supports ...
We propose an extended modal mu-calculus to provide an `assemblylanguage' for modal logics for real ...
Dans ce travail nous étudions la complexité de certains fragments du mu-calcul selon deux points de ...
International audienceIn the application domain of component-based system design, developing theorie...
We study the problem of specifying and verifying properties of ß-calculus processes while relying on...
We show that a type system based on the intuitionistic modal logic S4 provides an expressive framewo...
AbstractFor some modal fixed point logics, there are deductive systems that enjoy syntactic cut-elim...
Modal automata are a classic formal model for component-based systems that comes equipped with a ric...
Dans ce travail nous étudions la complexité de certains fragments du mu-calcul selon deux points de ...
In this report we introduce modal specifications, a new object dedicated to specify some branching-t...
International audienceWe introduce a new notion of structural refinement, a sound abstraction of log...
There are two fundamentally different approaches to specifying and verifying properties of systems. ...
We briefly survey the background and history of modal and temporal logics. We then concentrate on th...
The modal mu-calculus is an extension of modal logic with two operators mu and ni, which give the le...
In this paper we present a modal logic for describing properties of terms in the object calculus of ...
IspCal is a formal language well suited for describing synchronous digital systems, and it supports ...
We propose an extended modal mu-calculus to provide an `assemblylanguage' for modal logics for real ...
Dans ce travail nous étudions la complexité de certains fragments du mu-calcul selon deux points de ...
International audienceIn the application domain of component-based system design, developing theorie...
We study the problem of specifying and verifying properties of ß-calculus processes while relying on...
We show that a type system based on the intuitionistic modal logic S4 provides an expressive framewo...
AbstractFor some modal fixed point logics, there are deductive systems that enjoy syntactic cut-elim...
Modal automata are a classic formal model for component-based systems that comes equipped with a ric...
Dans ce travail nous étudions la complexité de certains fragments du mu-calcul selon deux points de ...