A Bisimulation characterization Theorem for Hybrid Logic with the current-State Binder
نویسندگان
چکیده
We prove that every first-order formula that is invariant under quasi-injective bisimulations is equivalent to a formula of the hybrid logic H{↓}. Our proof uses a variation of the usual unravelling technique. We also briefly survey related results, and show in a standard way that it is undecidable whether a first-order formula is invariant under quasi-injective bisimulations.
منابع مشابه
A Characterization Theorem for a Modal Description Logic
Modal description logics feature modalities that capture dependence of knowledge on parameters such as time, place, or the information state of agents. E.g., the logic S5ALC combines the standard description logic ALC with an S5-modality that can be understood as an epistemic operator or as representing (undirected) change. This logic embeds into a corresponding modal first-order logic S5FOL. W...
متن کاملLinking Theorem Proving and Model-Checking with Well-Founded Bisimulation
We present an approach to verification that combines the strengths of model-checking and theorem proving. We use theorem proving to show a bisimulation up to stuttering on a—potentially infinite-state—system. Our characterization of stuttering bisimulation allows us to do such proofs by reasoning only about single steps of the system. We present an on-the-fly method that extracts the reachable ...
متن کاملAlternating Regular Tree Grammars in the Framework of Lattice-Valued Logic
In this paper, two different ways of introducing alternation for lattice-valued (referred to as {L}valued) regular tree grammars and {L}valued top-down tree automata are compared. One is the way which defines the alternating regular tree grammar, i.e., alternation is governed by the non-terminals of the grammar and the other is the way which combines state with alternation. The first way is ta...
متن کامل“ 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...
متن کاملLinking Theorem Proving and Model - Checking
We present an approach to veriication that combines the strengths of model-checking and theorem proving. We use theorem proving to show a bisimula-tion up to stuttering on a|potentially innnite-state|system. Our characterization of stuttering bisimulation allows us to do such proofs by reasoning only about single steps of the system. We present an on-they method that extracts the reachable quot...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Rew. Symb. Logic
دوره 3 شماره
صفحات -
تاریخ انتشار 2010