Infinitary Domain Logic for Finitary Transition Systems
نویسندگان
چکیده
The Lindenbaum algebra generated by the Abramsky ni-tary logic is a distributive lattice dual to an SFP-domain obtained as a solution of a recursive domain equation. We extend Abramsky's result by proving that the Lindenbaum algebra generated by the innnitary logic is a completely distributive lattice dual to the same SFP-domain. As a consequence soundness and completeness of the innnitary logic is obtained for the class of nitary transition systems. A corollary of this result is that the same holds for the innnitary Hennessy-Milner logic.
منابع مشابه
Towards an infinitary logic of domains: Abramsky logic for transition systems
We give a new characterization of sober spaces in terms of their completely distributive lattice of saturated sets. This characterization is used to extend Abramsky’s results about a domain logic for transition systems. The Lindenbaum algebra generated by the Abramsky finitary logic is a distributive lattice dual to an SFP-domain obtained as a solution of a recursive domain equation. We prove t...
متن کاملToward an Infinitary Logic of Domains: Abramsky Logic for Transition Systems
We give a new characterization of sober spaces in terms of their completely distributive lattice of saturated sets. This characterization is used to extend Abramsky’s results about a domain logic for transition systems. The Lindenbaum algebra generated by the Abramsky finitary logic is a distributive lattice dual to an SFP-domain obtained as a solution of a recursive domain equation. We prove t...
متن کامل“ A Domain Equation for
Abramsky’s seminal article [3] is devoted to a detailed concurrency-theoretic application of the author’s “theory of domains in logical form” programme [4]. One of the main results in [3] is a logical characterization of the finitary bisimulation (cf. Theorem 5.8 on p. 191). (See [5] for a behavioural characterization of the finitary bisimulation.) More precisely, Abramsky shows that two proces...
متن کاملOn the Finitary Bisimulation
The finitely observable, or finitary, part of bisimulation is a key tool in establishing full abstraction results for denotational semantics for process algebras with respect to bisimulation-based preorders. A bisimulation-like characterization of this relation for arbitrary transition systems is given, relying on Abramsky’s characterization in terms of the finitary domain logic. More informati...
متن کاملOn the infinitary proof theory of logics with fixed points. (Théorie de la démonstration infinitaire pour les logiques à points fixes)
The subject of this thesis is the proof theory of logics with fixed points, such as the μ-calculus, linear-logic with fixed points, etc. These logics are usually equipped with finitary deductive systems that rely on Park’s rules for induction. other proof systems for these logics exist, which rely on infinitary proofs, but they are much less developped. This thesis contributes to reduce this de...
متن کامل