A Multi-Valued Simpliﬁed Halpern–Shoham–Moszkowski Logic for Gradable Veriﬁability in Reasoning about Digital Circuits

: In 1983, B. Moszkowski introduced a ﬁrst interval-interpreted temporal logic system, the so-called Interval Temporal Logic (ITL), as a system suitable to express mutual relations inside intervals for reasonings about digital circuits. In 1991, Halpern and Shoham proposed a new temporal system (HS) to describe external relations between intervals. This paper is aimed at proposing a basis-type combination of HS and a simpliﬁed ITL end extends it towards a multi-valued system—also capable of rendering a gradable justiﬁcation of agents in a similar contexts of reasoning about digital circuits. This newly introduced system is semantically interpreted in the so-called ﬁbred semantics.


The Interval Temporal Logic Systems
The majority of realistic requirements-imposed on different IT-systems (they may refer to their liveness, safety, or activity.) often require temporal logic systems with nonpointwise semantics to be properly represented formally. Different context-oriented analysis and observations, f.e. from [1][2][3], visualized a need to explore interval-based semantics temporal logic systems in many engineering contexts, such as reasoning about digital circuits or specification of the instruction set processors.
The observations seemed to motivate B. Moszkowski to propose a complex frame of the interval-based temporal logic system-recognized as 'Interval Temporal Logic' (ITL) and introduced in [4,5]. Its utility manifests itself in its capability of uniformly describing the structure and dynamics of timing-dependent digital circuits. A potential application area of this formal system is determined by various devices, including the delay elements, adders, latches, counters, flip-flops, random-access memories, or a clocked multiplication circuit.
Whereas ITL forms a multi-modal system adaptable to represent temporal (internal) relations between intervals and their subintervals, such as next, begin, fin, halt, keep and yield, its younger sister to be called Halpern-Shoham logic (HS) constitutes a multi-modal logic suitable to represent the so-called Allen's temporal relations between (mutually external) intervals (see: [6]). It was introduced and described in detail by Halpern and Shoham in [7]. This primary difference between these two formal systems finds its further extensions in mutually different directions of exploring these systems. In fact, whereas HS has been intensively explored in such works as [8][9][10][11]) mainly from a metalogical perspective, ITL is usually discussed in different contexts of programming-applicable specification for such formal features of IT systems (hardware, software, etc.) as liveness or safety. This fact finds its reflection in such works as: [5,[12][13][14].

•
Both systems-ITL and HS-are only suitable to express internal and external temporal relations (resp.) and cannot grasp their combinations. • Existing types of semantics for these systems usually are not sensitive to different pragmatic aspects of the modeled situations that should be considered from the perspective of the requirement of their adequacy and realism.

•
Even if a piece of pragmatics is considered in these types of semantics-such as in the so-called Fagin's behavioral one from [21]-they are not suitable to model the combined formulae for a temporal and a non-temporal type. • Even combined formal systems, such as epistemic HS from [22], describe some unrealistically idealized epistemic capabilities of agents.
• Last, but not least-due to author's best knowledge-no more advanced model checking machinery has been yet elaborated for digital circuit's properties and behavioragainst so sophisticated attempts to adopt bounded model checking for microprocessor architectures-as in [23].
In order to formulate the initial problem for its further representation in our multivalued HS-based modeled extension of ITL and modeling in its models-one needs to underline the extraordinary suitability of ITL from [4] to grasp the digital circuit's behavior and properties. Moszkowski's formalization attempt refers to different types of computational circuits, such as adders (see: [4], pp. 55-64), multipliers (see: [4], pp. 86-88) or the data handling combinational circuits, such as Multiplexer (see: [4], pp. 86-88) and many others. It is noteworthy to see that the monadic predicate version of ITL is exploited to express such entities as bits or signals through some unique model operators A , T , I (We omit a detailed explanation of their semantics.) as a formal representation of the phrases: 'for all internal subintervals (of a given one),' 'for all terminal subintervals' and 'for all internal subintervals' (resp.) For example, two predicates bit and Bit are used to represents bits: the predicate bit checks if a value is either 0 or 1 and the predicate Bit checks that its parameter is always bit-valued -due to the formal depiction in [4], p. 29: Putting aside the whole taxonomy of ITL predicates, one can observe that some of them are especially useful and play the role of technical predicates to be exploited in further formalization attempts. One of them is the 'LoadPhase' predicate. Due to [4], p. 107-the predicate 'LoadPhase' specifics device operation for initially loading the inputs.
Independently of these types of formalization attempts-often arises a need to formally specify and adequately model different integrated systems and complicated scenarios, such as the reasoning of an operating agent (with epistemic capabilities) about processes in the world of digital circuits. An exemplary situation of this type, for which formalization of the 'LoadPhase' predicate is used, is described in the following Motivating Example.
The Motivating Example 1. Let us consider an agent-observer i, which supervises some fragment of the 'loading phase' action performing and let us assume that it verifies with some degree α a (materialization of its) subprocess 'after some time (later): initially was H and finally 'status = 1' occurred'.
In order to specify the situation described in the Motivating Example-it is convenient to start from the ITL-formula defining the process of loading phase as follows (This ITLformula delivers a more general scheme of representing some types of actions (similar to 'LoadPhase' above) in terms of the appropriately specified atomic formulae (like 'Load(H)', 'Init(H)', 'status=1' above) using a modal-type operator (like: 'fin'). The Formula (1) constitutes a convenient basis for further extensions and is sensitive to further modifications and combinations. These possibilities seem to justify a paradigmatic nature of the formula, although one could indicate other formulae for this analysis.) (see: [4], p. which renders the temporal action sequencing-previously rendered mainly by → in terms of HS-modal operator [L] (for 'Later') of the box-type. However-in order to adequately express the scenario from the Motivating Example-we need a new epistemic modal-type operator, say [V] α i φ which expresses the agent i verification of (an event, a process, etc.) φ with a degree α (This formula is read 'An agent i verifies φ with a degree α.' Intentionally, we intend to consider a finite set of such possible degrees of agent verification of the given event or processes, etc. They might be dependent on their observability, but we put aside this type of considerations as redundant from the perspective of the paper analysis).
This fact may be rendered by the following combined formula: The example will constitute a practical component of the main objective of the paper analysis-to find the appropriate semantics suitable to model the formulae of the same sort.
Unfortunately, some further difficulties and limitations of this task should be taken into account. Fortunately, they simultaneously indicate the direction of the task materialization.

•
The full ITL is too excessive for the requirements. Thus we restrict ITL to its propositional variant. • Some fragments (f.e. these of the arithmetic nature) of the propositional ITL-as defined in [4]-seem to be already too heterogeneous to constitute a convenient starting point of the hybrid system construction. Therefore, these arithmetic-based fragments of ITL will be replaced by the corresponding description-logic formulae. • Finally, Gödel-Löb logic of provability cannot be adapted as an adequate logic for gradable verifiability, but it partially delivers a pattern or a surrogate for it. Therefore, it will be exploited in a role of basis in the hybrid formal system construction process. • Last, but not least-Gabbay's frame of the so-called fibred semantics from [24] exists for a point-wise semantics only, but it seems to be adaptable to an interval-based semantics. Thus, it will be used in the paper.

Objectives of the Paper
Due to the motivation factors-the main objectives of the paper are (in chronological order): • to propose a multi-valued logic for gradable verifiability (MVer), • to introduce a new hybrid system MVHSM as a unique combination of Halpern-Shoham Logic, Simplified Interval Temporal Logic of Moszkowski and multi-valued logic for gradable verifiability (MVer) (a specification of the combination will be explained in details later.) • to elaborate a general frame of the interval counterpart of Gabbay's fibred semantics, • to semantically interpret the newly introduced MVHS in the fibred interval semantics, • to describe a general frame of model checking for MVHSM and its possible extensions.
From a more practical perspective, this paper is aimed at proposing a potentially paradigmatic method of semantic modeling of agent's reasoning about digital circuits in terms of the combined MVHSM system.
One needs to underline that the paper belongs to the common intersection of research on temporal logic systems and knowledge representation as a part of AI. As such, the paper does not refer to digital circuits themselves in their electronics-based depiction (In fact, we rather consider them in a slightly more idealized perspective, i.e., as unique acyclic directed graphs.), but it refers to their formal properties and pieces of reasoning about them-as expressible in MVHSM and its potential extensions. One should underline that the deceptively purely logical nature of these analyses is essentially oriented for the idea of a combined model checking of both formal properties of digital circuits and pieces of reasoning about them.
Reasoning about them constituted the primary motivating factor for the construction of Moszkowski's Interval Temporal Logic. Meanwhile, this system forms one of two pillars of the newly constructed MVHSM system.

Organization of Paper
The rest of the paper is organized as follows. In Section 2, a terminological framework of analysis is put forward. In Section 3, a simplified Halpern-Shoham-Moszkowski Logic (HSM) is introduced syntactically. A Multi-Valued Verifiability Logic (MVer) is presented in Section 4 syntactically and semantically. In Section 5, the hybrid system of Multi-Valued Simplified Halpern-Shoham-Moszkowski Logic for Gradable Verifiability (MVHSM) is introduced and semantically interpreted in the interval fibred semantics. Section 6 explains a broader model checking-orientation of the paper analysis. In Section 7, state of the art is described. Section 8 contains the final remarks and conclusions.

Terminological Framework
Before we move to the right part of the paper, a conceptual apparatus -for ITL and HS and their semantic interpretations in the Kripke frame-based models will be put forward. We start its presentation from the so-called Interval-Based Interpreted System (IBIS) as unique transition systems. Although we intend to exploit Kripke frame-based models as a basis for the so-called fibred semantics for the hybrid MVHSM system, it seems reasonable to begin with transition systems. This solution gives an excellent opportunity to grasp deep relationships between them and their corresponding Kripke frames and an internal organization of Kripke frames. Finally, it enables understanding how discrete intervals may be created.
Secondly, a simplified ITL and Halpern-Shoam logic are presented in their syntactic and semantic depictions.

Kripke Frame-Based Interval Semantics
We begin our interval-based semantics presentation with a definition of a tree-like order (For a terminological background of the analysis, we adopt most of the definitions from [22], modifying some conditions for labeling functions. We also adopt the so-called homogeneity principle w. r. t. these functions-as this principle ensures that the same formula φ labels the whole interval I and each internal point of it (see: [25])).

Definition 1.
We say that S, ≤ is a tree-like order iff: • it is strongly discrete, i.e., there are only finitely many points between any two points and the the order contains the least element, • for any a, b, c ∈ S, if a ≤ c and b ≤ c, then either a ≤ b or b ≤ a.
We also consider a finite set A = {1, . . . , m} of agents such that each agent i is endowed with a set of global states L i , i ∈ A and a set of local actions which produce a transition relation t. In such a framework, we adopt the following definitions. Definition 2. Let Lan be a propositional language with a set of propositional variables Prop. An Interval-Based Interpreted System (IBIS) is a tuple (S, s 0 , t, Lab) such that • S ⊆ L 1 × . . . L m is a set of tuples of global states reachable from the initial global state s 0 via t, • t ⊆ S 2 is a transition relation between states such that S, t forms a tree-like order with s 0 as its least element, • Lab: S → 2 Prop is a labeling function, which for I = s 1 , s 2 , . . . , s k is defined as follows: Lab(I) = φ ∈ Prop, for i ≤ k provided that the following homogeneity principle is true: φ ∈ Lab(I) if and only if φ ∈ Lab(s 1 ), φ ∈ Lab(s 2 ), . . . , φ ∈ Lab(s k ).
IBIS may also be seen as an unraveling of the generalized Kripke frame.

Definition 3.
An interval is a finite path in IBIS, or a sequence I = s 0 s s . . . s n such that s i ts i+1 for 1 ≤ i ≤ k − 1, and a transition t. A restriction of an interval I (with a length l) to a sequence of its first k-states (for k ≤ l) will be denoted by I| k and called a k-prefix of I or its k-initial subinterval. The subsequence s i . . . , s n of I for 1 < i ≤ n forms its terminal subinterval. Finally each sequence s i . . . s j , for 0 ≤ i ≤ j ≤ n forms an intermediate subinterval of I.
We also assume that each global state s from S of IBIS consists of local states. For a global state s = (l 1 , l 2 . . . , l m ) the local state l i in a global state s will be denoted by l i (s), for i ∈ A. Example 1. Consider some IBIS-system with an agent 1, which is endowed with a global state L = {l A , l B , l C } with three local states and with a 2-elemental set of actions {a 1 , a 2 }. As an example of the transition one can consider: t = { l A a 1 l A , l A a 2 l B , l B a 2 l C }.
The mutual relationship between an IBIS-ontology and epistemology of agents can be explained as follows. Intervals states I and I with a length k and l (resp.) are indistinguishable by an agent (formally: I ∼ i I ) if and only if k = l and l i (s j ) = l i (s j ), for all j ≤ k, s j ∈ I, s j ∈ I , i.e., the corresponding local states s j and s j are identical. This property will be called-due to [21,26]-the behavioral equivalence and it plays a role of our meta-assumption in the paper.
Whereas each Kripke frame may be viewed as a variation of an (unlabeled) transition system, each Kripke frame-based model (briefly: Kripke model) may be seen as a variation of its corresponding labeled transition system, such as IBIS. The main difference between them relies on using another type of a corresponding function between a given formal language, say L with a subset of its propositional variables Prop and its semantic interpretation in a given universe, say W. There is a valuation-as a function from 2 Prop → 2 W in models and a labeling function as a function from 2 W → 2 Prop in transitions systems. The formal definition of a Kripke frame model is as follows.
Definition 4. Let L be a propositional language with a set of its propositional variables Prop. The Kripke frame model over a given ρ-Kripke frame F = W, {R i } i∈ρ , for i ∈ ρ, is a structure of the form M = F , V , i.e., M = W, {R i } i∈ρ , V , where V : 2 Prop → W is a valuation (The definition of valuation function from 2 Prop → 2 W may be easily extended for all well-formed formulae of a given language L with modal operators (of a box-and a diamond-type). That extension may be defined recursively as follows: If the universe set W from the Kripke model M consists of points, we deal with the point-wise Kripke models. If the model universe contains intervals, we say about the interval-based Kripke models. Example 2. Let L be a propositional language with Prop ={α, β}.

2.
Simultaneously, the structure M 2 = W 2 , R 2 , V 2 , where: forms an example of an interval-based Kripke frame-based model extracted from IBIS in Figure 1 (right).
The concept of Kripke frames will be initially exploited for establishing a satisfaction relation for both ITL-formulae and HS-formulae in Figure 2. Finally, it will constitute a basis for the fibred models for our hybrid JusHSM.

Simplified Interval Temporal Logic (SITL) and Halpern-Shoham Logic (HS)
The general remarks on the nature of Kripke frame-based semantics allow us to characterize both SITL and HS now.
I. Simplified Interval Temporal Logic of Moszkowski. ITL-defined in [4]-as a far modification of LTL of A. Pnueli-forms a highly expressive predicate modal-type representations of temporal relations that may be indicated between subintervals of a given interval. The relations next and semicolon constitutes the basis relations. They are used in defining further relations: begin, finish, halt, keep, yields, always, eventually, next (The full presentation of ITL may be easily found in [4]. Its presentation will be omitted for the brevity of this section and compactness of the analysis.).  In this paper, a simplified propositional variant of ITL of Moszkowski-the so-called Simplified ITL (SITL) is put forward. Introducing SITL we decide for a slight reconstruction modification of the original depiction of ITL from [4,5]. The foundation differences are the following: • the uni-modal temporal operators of ITL restricted to begin, finish, halt, keep, always, eventually, next are admitted in syntax of SITL only (It means that we reject i.a. a bi-modal yield operator.), • slightly against the original Moszkowski's approach-the mutual relations between intervals and their subintervals are more explicitly given and considered as unique Kripke accessibility relations (Indeed, Moszkowski seems to consider these relations (different types of inclusions) as implicitly presupposed.).

Syntax of SITL.
Let us assume that p, q form propositional variables, p; q stands for 'p semicolon q'(p followed by q) and let us adopt a couple of unique atomic formulae: true, empty, skip. Then the syntax of SITL-entities is given by the grammar: where p, q are propositional variables, G I (p) stands for: 'generally in initial subintervals p', F I (p) stands for: 'eventually in initial subintervals p', G T (p) stands for: 'generally in terminal subintervals p', F T (p) stands for: 'eventually in terminal subintervals p'. The pair: G A (p), F A (p) stands for the intermediate subintervals, N(p) for: 'next p' and X(p) denotes a modal operator for X-relation, where X ∈ {begin, finish, halt, keep}. Some of the formulae are mutually co-definable. For example: Meanwhile, the modal-type operators enable of defining some new operators introducing their co-definability and a piece of creativity inside SITL (see: [4], pp. 16-17) (This fact elucidates the concise presentation of the SITL grammar as given by (4) and (5)): For example, (7) asserts that = halt(p) is true for intervals that terminate the first time the formula p is true. Thus 'halt' can be thought of a forcing an interval to wait until p occurs [4], p. 17. (9) for 'fin' asserts that p holds for a terminal subinterval of length 0, i.e., for the interval's final state. Their semantics will elucidate a more profound sense of the operators.
A deeper sense of the operators will be elucidated by their semantics.

Interval models for Simplified-ITL (SITL).
Before we specify the semantic relations associated with the unary-modal SITL operator to deeper specify Kripke model-based semantics for SITL, we will be initially based on the definition of Kripke frame-based models for SITL as a triple: W, X, V , where: • W is a (non-empty) domain consisting of finite discrete intervals, • V is a valuation, i.e., V : 2 L(SITL) → 2 W satisfying the usual conditions imposed on this function, and • X is a relation between intervals from W and their subintervals to be called 'Moszkowski's relation'.
Let us establish now that I= s 0 . . . s n ∈ W, I| s 0 ...s j = s 0 . . . s j denotes a proper subinterval of I consisting of the points s 0 up to s j for some j < n, I| s i ...s n = s i . . . s n denotes a proper subinterval of I consisting of point from s i up to s n for some 0 < i < n, etc.
If φ ∈ L(SITL), M is an interval Kripke frame-based model, then-due to [4]-the satisfaction for the ITL-operators is introduced by the appropriate clauses as follows. (This definition collects and slightly reconstructs single conditions for satisfaction scattered over pp. 11-12,15,16 of [4].) Definition 5. (Satisfaction for SITL) Let us assume that an interval Kripke model M with a non-empty universe W and a discrete interval I = s 0 . . . s n ∈ W are given, for some fixed k. The following clauses define satisfaction relation for L(SITL): The satisfaction conditions for other operators may be introduced via their syntactic co-definability with the operators just presented.
It is easy to see that satisfaction conditions from Definition 5 are not explicitly involved in accessibility relations between intervals-as usual in Kripke frame-based semantics. Nevertheless, it is not difficult to see that these relations (inclusions ⊆) may be easily extracted from the conditions. In fact, they are of a (slightly) different sort. The inclusions associated with G T (F T ) operators will be denoted as ⊆ T and they connect intervals with their terminal subintervals. By contrast, the inclusions associated to G I (F I ) operators will connect intervals with their initial subintervals and denoted by ⊆ I . Finally, the inclusions ⊆ A will be associated to G A (F A ) and connect intervals with their intermediate intervals-due to the satisfaction condition for these operators. Finally, we can venture to name some chosen relations. Namely, f inish, keep, halt, begin will be semantic counterpart of SITL operators: fin, keep, halt, beg (We decide to treat them here as modal operators-as we think about them as about fin(), keep(), halt(), beg(). If a propositional variable is fixed, say p, then the corresponding fin(p), keep(p), halt(p), beg(p) are unary predicates.) (resp.) These arrangements lead to the unitary and generalized satisfaction condition: for ⊆∈ {⊆ I , ⊆ A , ⊆ T }, and ♦ SITL being a diamond-type unary operator of L(SITL). The corresponding condition for SITL operator requires a general quantifier instead of the existential one.
II. Halpern-Shoham logic. Whereas ITL and its simplified version SITL are capable of rendering the internal relations inside a given temporal interval (between its inherits fragments), HS renders external relations between a given interval and other intervals.
Syntax. More precisely, HS constitutes a modal-type representation of temporal relations between intervals, originally defined in [6]: "after" (or "meets"), ("later"), "begins" (or "start"), ("during"), "end" and "overlap" ; see also [7]. These relations correspond to the modal HS operators: A for "after", B for "begins", L for "later", etc. The syntax of HS entities φ is defined by: where p is a propositional variable and Ȳ denotes a modal operator for the inverse relation w. r. t. Y ∈ {A, B, D, E, O, L} being a set of Allen's relations.
Semantics. As earlier mentioned-the appropriate semantics of HS forms a kind of the interval-based semantics. Denoting by P (N) the set of all closed Sometimes, the interval-based models for HS base on generalized Kripke frames, i.e., on the triples of a more general form W, Y, V , where W is a (non-empty) domain, V is a valuation (Alternatively, we can define the corresponding IBIS-based model provided that we exchange a valuation V for a labeling function.) and Y ∈ {A, B, D, E, O, L}. If φ ∈ L(HS), M is a Kripke frame-based model of this type, and I ∈ W, then satisfaction for ♦-type modal HS operator is given as follows: Exchanging ∃-quantifier for the general one, we can obtain the corresponding condition for -type modal operator.

A (Simplified) Halpern-Shoham-Moszkowski Logic
Having defined both SITL and HS, we are in a position to propose an integrated temporal logic system to be called Halpern-Shoham-Moszkowski logic (shortly: HSM). In this section, HSM is introduced syntactically only-as a complex presentation of its semantics requires a new combined type of semantics to interpret combined formulae of HSM. It will be elaborated in Section V as the so-called fibred semantics, and it will be retrospectively adopted to HSM formulae.
It arises a question how to combine these two systems. It seems that the most simple and (perhaps) the most natural way to do it is to consider their fusion (or an independent sum). Generally, if Log 1 , Log 2 are two modal logics in languages L(Log 1 ), L(Log 1 ) (resp.) and they have disjoint sets of modal operators, say 1 , . . . n and n+1 , . . . , m (resp.), then the fusion of Log 1 and Log 2 is the smallest (n + m)-modal logic containing both Log 1 and Log 2 . Therefore, let us assume that a new language L HSM = L ITL ⊗ L HS being a fusion of L ITL and L HS . Nevertheless, we intend to admit some combined formulae of ITL and HS, thus the new HSM should constitute a kind of superset of a usual fusion ITL ⊗ HS. In other words, a set of well-formed formulae of ITL ⊗ HS, say FOR HSM , should contain the set FOR ITL⊗HS ={φ: either φ ∈ FOR SITL or FOR HS } as its proper subset.
Nevertheless, not all combinations should be admitted because of a nature of the scenario from the motivating example (see: Introduction), which indicates the admissible order of the modal operators of HMS. Namely, HS operators play the role of the external operators for the ITL's ones. In fact, the situation should be initially described inside a given interval, and-eventually-its materialization may be moved in time (performed in another interval provided that it remains in the initial one in Allen's relation).
It allows us to define a set of well-formed formulae FOR HSM of HSM in L HSM = L SITL ⊗ L HS . Definition 6. (Set of well-formed formulae of HSM) A set FOR HSM of well-formed formulae of HSM is given by the following grammar: where φ, ψ are propositional variables and X ∈ { f inish, begin, keep, halt}, N(φ) is 'next'-operator and F * (φ) and G * (φ) are mutually co-definable temporal operators 'eventually' and 'always' for * ∈ {I, T, A} and Y ∈ {A, B, D, E, O, L} is an Allen's relation. The models and satisfaction relations are introduced for uni-modal formulae of HSM, as depicted in Section 3. The fibred semantics for multi-modal formulae of HSM will be given in Section 4.

Towards a Multi-Valued Logic for Gradable Verifiability
Before we propose the fibred semantics for combined formulae of HSM already introduced, we need to elaborate at first a multi-valued logic for gradable verifiability (MVer) to integrate it with HSM. In this way, the hybrid VerHSM will be introduced.
In this section, the lacking component MVer will be elaborated. In general, we intend to adopt the formalization tradition for the close-related concept of provability in terms of Löb-style modal conditions (see: Introduction). Comments of Ayer, Chisholm, and Gettier regarding the justification as an epistemic capability of agents from [28][29][30] will determine the final exploration direction.
Towards a Basis Verifiability Logic. It remains to decide which modal logic system should be adopted as a basis system for the verifiability logic construction. In order to find the most reasonable solution, we now consider three candidates aspiring to this role.
The first-and potentially the most natural-candidate seems to be the Gödel-Löb logic GL which expresses Löb's provability conditions for Gödel's incompleteness theorem in terms of -modal operators. The following axioms K, 4 and GL determine its axiomatic system-as already mentioned in the Introduction-: Independently of this concise modal representation of provability in the axiom-based framework of GL logic-it remains some difficulty with the naturality and universality of the third condition. Indeed, one can argue that it has a relatively narrow and technical sense (for the use of the proof of Gödel's theorem), and it should not be easily extrapolated for a broader spectrum of contexts.
The concurrent solution in the same formalization approach to arithmetic provability oscillates around its representation by formal properties of Prov()-predicate given by the so-called Rosser's sentence (see: [31,32]), the chronologically second metalogical example of an undecidable Gödel's sentence. It asserts-as a self-referential sentence-that if it has proof in PA with a Gödel number k, then its negation has a proof in PA with a Gödel number m smaller than k (In fact, it forms a roundabout method for this sentence to state its own non-provability. The predicate version of the sentence may be found in [31]-due to the original one from [32]. We omit its presentation because it is redundant from our perspective.). In this way, provability was explicitly combined with a time sequence relation in Rosser's trick for his Gödel sentence construction and his concept of provability in general. On the one hand, an idea to exploit Rosser's sense of provability in our approach seems to well correspond to our main idea of combining verifiability with time. On the other hand, there is no explicit axiomatic depiction of provability involved in Rosser's sentence-even against a promising effort of Smullyan to give Rosser's sentence an epistemic face. He made it in terms of a belief operator B (If α is an atomic, self-referential sentence:'I am provable in PA', '<' is the time sequence relation, then the Rosser's sentence may be identified with α ⇐⇒ ¬(Bα < B¬α) (I am provable only if you cannot believe that I am provable earlier than you believe that I am not provable).). In addition, Smullyan's approach forms a taxonomy of axiom systems dependently on agent epistemic capabilities established a priori (such as agent-Besserwisser, an epistemically naive agent, etc.) Meanwhile, we rather intend to find an axiom system for describing formal properties of (gradable) verifiability itself, while the agent's epistemic capabilities may be flexible and context-dependent such as reasoning about digital circuits.
Returning to the formalization approach in terms of GL, it seems to be reasonable to exchange the technical axiom GL for a more general axiom T: 'if A is justifiable, then it is true' in our approach. Indeed, this axiom much better materializes an idea of the truth assignment to different logical statements based on an acceptance of their premises. It leads to the exchange of axioms: K, 4, and GL for the conjunction of K, 4, and T. In this way, GL will be exchanged for S4-as a basis for further constructions. It forces some conditions imposed on the semantics of the newly introduced MVer-because S4 is complete w. r. t. the models based on the partially ordered Kripke frames (Obviously, S4 adequately describes (in the sense of completeness) not only partially ordered structures, but also such entities as dense-in-itself metric spaces ( [33]), etc. Nevertheless, this "unintended" S4-semantics will not concern us as redundant and inadequate.).
Multi-Valued Logic for Gradable Verifiability. It only remains the question of how to modify the epistemic S4 to make it suitable to represent gradable verifiability in order to define MVer. In order to do it-let us introduce a finite set of different parameters in a role of degrees of 'being verifiable'. More precisely, we will admit new parametrized modal operators of the type: [V] α i φ (for: 'φ is justifiable by an agent i with a degree α), where [U]φ is an ordinary box-type operator read: 'φ is justifiable'). It is convenient to treat the α-parameters as normalized, i.e., α ∈ [0, 1]. Since a finite set of such α's degrees is usually enough in practice, this new MVer will form a multi-valued logic system (Let us note that even such an extremal case as [U] 0 i φ (φ is justifiable by i in the degree 0) does not violate our meta-assumption concerning a purely descriptive character of our system, we consider this case as acceptable.). Summing up, we intend to identify MVer with a multi-valued epistemic S4.

Multi-Valued Epistemic Logic (MVJus)-A Syntactic Depiction.
These postulates-just formulated-will find their reflection in syntax of MVer by introducing the following two modal operators: 1.
[V] α i φ for: 'φ is (strongly) justifiable by an agent i with a degree α' and 2.
V α i φ, for: 'φ is (weakly) justifiably by an agent i with a degree α', for atomic φ and an arbitrary, but fixed rational parameter α ∈ G ⊂ [0, 1]-due to [34,35]. It allows us to establish a grammar of MVer as follows.
Language of MVer. Let G be an arbitrary, but fixed finite subset of (parameters from) [0, 1]. The language of MVer, L(MVer), is given by the following grammar: where i ∈ A, α is an arbitrary, but fixed rational parameter from G. The following definition establishing a co-definability of modal operators of MVer and the following axioms are incorporated in the syntax of MVer.

1.
All axioms of Boolean propositional calculus, 2. [ α rational and G finite. It allows us to define MVer as a formal theory in the following manner. 1.
[V] 3 4 i 0 [V] 1 2 i 0 skip(p) does not because we admit α as fixed during for the whole formula construction only.

Interval-Based Semantics for MVer
In this paragraph, MVer will be interpreted in Kripke interval-based semantics. As usual, a "core" of its construction is a two-stage construction the appropriate accessibility relation between intervals i (for i ∈ A). This relation is intended to constitute a nonsymmetric similarity relation (Let us note that a usual similarity (as a purely qualitative) relation is an equivalence relation. Indeed, it is reflexive, symmetric, and transitive. Nevertheless, if we are interested in a numeric scale of similarity-this relation violates symmetry. This fact suggests us a research direction. Indeed, we will specify α i numerically.) and partially have a pragmatic nature (as agents index it) to introduce a piece of behavioral semantics. Additionally, this relation will be specified later by α's in the construction's next-stage -due to some ideas previously eleborated in [27,36].
Accessibility relation i . For defining this accessibility relation let S be an initial (reservoir) set of finite intervals (Pedantically, S might be defined as a power set of all finite sequences of points taken from a non-empty W. For simplicity of current analysis we omit this initial stage of the construction.), and let the intervals I = s 1 s 2 . . . s k ∈ S, and I = s 1 s 2 . . . s l ∈ S, for some k, l. Let us also establish an agent i ∈ A and let us define a new accessibility relation i ⊆ S × S between intervals I and I as follows: i.e., an agent i cannot distinguish between the corresponding states of I and I up to j state, between j-prefixes of both intervals. In other words, or if and only if the behavioral equivalence condition (see: Section II) holds for j-prefixes of these two intervals. It is not easy to show that i forms a partial order, i.e., it is reflexive, anti-symmetric, and transitive, for each in ∈ A. Thus, it forms an adequate relation for Kripke models for S4. Theorem 1. The relation i ⊆ S × S defined by (12) forms a partial order, for each i ∈ A.
Proof. Let us establish an agent i 0 ∈ A. It is clear that I i 0 I, so the relation is reflexive.
If assume that two I and I are arbitrarily chosen and such that length(I) = k, length(I ) = l and I i 0 I , then k ≤ l and it is not true that l ≤ k (for all such pairs). Thus, it cannot hold I i 0 I-due to (12) in a general case. Obviously, if symmetry holds, then I = I . Hence, i is anti-symmetric.
If I, I and I are such that length(I " ) = m, and I i 0 I and I i 0 I , then also-due to (12) -k ≤ l and l ≤ m and l i (s j ) = l i (s " j ), for all j < k. It exactly means that I i I " , i.e., i is also transitive for the fixed i 0 ∈ A. The thesis of Theorem follows from the fact that i 0 was chosen arbitrarily.
Accessibility relation α i . Obviously, i relation is not suitable to grasp gradable verifiability by agents. In order to empower i for this task, we should modify this relation. Therefore, let us establish a finite G ⊂ [0, 1] and let us consider some technical function • : S × S × A → G defined as: Intuitively, this new function associates the earlier relation i between I and I to some rational α from [0, 1] (The appropriate methods of achieving of α will be discussed later.). We are in a position to introduce a new relation in the product S × S × G × A as a unique enhancement of the previous i as follows: Obviously, this general way of defining α i does not determine its nature precisely. Its algebraic properties depends on a method how α is defined. However, this way of introducing α i allows us to preserve some crucial properties of i such as anti-symmetry. It follows from the condition length(I) ≤length (I ) for a given pair of intervals I and I (In fact, if I α i I for intervals I and I and some i ∈ A, then length(I) ≤length (I ) and the inverse inequality does not hold (in a general case), thus it is not true that also I i I. It already disconfirms symmetry.).
The following example ( Figure 3) illustrates now how a way of defining α influences an algebraic nature of α i .

Example 6.
Consider a pair of discrete intervals (I 1 , I 2 ) : I 1 i I 2 having j = 10 common points and define α = I 1 i I 2 = j(I 1 ,I 2 ) K for some K = 200 > length of each interval and each i ∈ A. Thus, their similarity α = I 1 i I 2 ) = 10 200 = 1 20 . Assuming that I 2 i I 3 we always obtain I 1 i I 3 ∈ [0, 1] by this way of establishing α. In fact, we always find an α value no greater than 1 (because of a denominator = 200) and α ≥ 0. (It there is no common point we obtain 0). Obviously, length(I 1 ) ≤ length(I 3 ), thus this way of defining α also preserves transitivity.
where S = ∅, α i is an accessibility relation on S × S × A and h : L(MVer) → 2 S is a truth assignment function (As usual, we treat the assignment function as an extension of a valuation function running from a set of propositional variables to a a family of subsets of S. We decide for such a slight modification because of further analysis around fibred semantics, where usually assignments are considered instead of valuation functions.).
It allows us to introduce the following inductive definition of satisfaction for MVer-formulae.

Definition 10. (Satisfaction) Let M = S, α
i , h be a Kripke interval model associated to a nonempty set A for L(MVer) with a set of propositions Prop. Given a formula φ ∈ L(MVer), an interval I ∈ S and a finite set G ⊂ [0, 1] we inductively define the fact that φ is satisfied in M, in an interval I (symb.I |= φ) as follows (It is easy to reformulate this definition for satisfaction in the corresponding IBIS system. In fact, it is enough to exchange the initial condition for atomic formulae from Prop for the condition: for all p ∈ Prop, we have IBIS, I |= p iff p ∈ Lab(I).): 1.
For all p ∈ Prop, we have M, I |= p iff I ∈ h(p). The key clauses in this definition are that one referring to the modal operators [U] α i φ and V α i φ. These conditions assert that these formulas are satisfied in I of M iff the atomic formula φ holds in all intervals (at least one interval) accessible from this I via α i -relation (resp.).
It remains to reconcile syntax of MVer with its semantics given by Kripke interval models as defined in (14)-at least in the form of soundness (The proof of completeness would require more detailed analysis and the construction of the appropriate canonical models.). It means that all formulae MVer are satisfied in Kripke models of this type.

Theorem 2. (Soundness of MVer) Theory MVer is sound with respect to all Kripke interval models with accessibility relation α
i defined by (13), for each i ∈ A and fixed rational α ∈ [0, 1].

Proof.
For the established i 0 ∈ A and the parameter α 0 ∈ [0, 1] the proof runs as in a standard way for classical model logic systems. One needs to show that all axioms K, 4, and T are satisfied in Kripke models defined by (14). In order to illustrate, we consider axiom T only. Therefore, let us assume that M = S, α i , h is such a Kripke model associated to A and α ∈ [0, 1] and φ ∈ Prop L(MVer) . Let us establish an agent i 0 and α 0 ∈ A and assume that M, I |= In this way, a Kripke frame-based interval semantics was determined for MVer. It will be exploited as a component of the fibred semantics for the hybrid MVHSM.

Multi-Valued Simplified Interval Temporal Logic (MVHSM)
Having elaborated the appropriate conceptual apparatus to combine MVer with HSM, we are in a position to introduce the hybrid MVHSM. It will be suitable to grasp not only the gradable verifiability (like MVer), but also temporal relations between intervals of the external nature (like HS) and the internal one (as ITL). One needs to underline that MVHSM constitutes more a reservoir of its possible subsystems than a complete axiomatic formal system. In this sense, its construction preserves the nature of both HS and ITL, which should be viewed in a similar way.

Syntax of MVHSM
As previously, a usual fusion cannot constitute a construction basis for MVHSM. It follows from the requirements to admit different combinations of MVer-formulae with HSM-formulae. Meanwhile, the nature of Formula (3) from the motivating example delivers a coupe of potentially useful guidelines on how to combine these two systems.
* modal operators of MVer should be the most external in the combined formulae of MVHSM, ** modal-temporal operators of HS should be internal with respect to the MVer operators but external with respect to modal-temporal operators of ITL.
To cut a long story short, ITL-operators should be the most internal, MVer-operators should be the most external.
We will define a set of well-formed formulae of MVHSM, say FOR MV HSM , in a language L(MV HSM) being a fusion language, i.e.,  (15). Then a set FOR MV HSM of well-formed formulae of L MV HSM is given by the following grammar based on the following taxonomy of types of formulae: where φ, ψ are a propositional variable, i ∈ A, where A is a set of agents, α ∈ G and X ∈ { f in, beg, keep, halt}, N(φ) is 'next'-operator and F * (φ) and G * (φ) are mutually co-definable temporal operators 'eventually' and 'always' for * ∈ {I, T, A}. Finally, Y ∈ {A, B, D, E, O, L} is an Allen's relation.
By analogy, MVHSM is defined as the most minor theory in containing all formulae FOR MV HSM and closed on Modus Ponens, substitution and the corresponding inference rules for formulae of MVer and HSM.
[V] α i N B φ does not, for α ∈ [0, 1] and i ∈ A because the order N B is prohibited by the syntax of MVHSM.

Semantics for Uni-Modal Formulae of MVHSM
Having defined the syntax of MVHSM, we will propose a complex frame of a semantic interpretation of this formal hybrid system. Due to previous establishments-we will make staring from uni-modal formulae of L(MVHSM). Indeed, the semantic interpretation of uni-modal formulae of L(MVHSM) has already been introduced when each of the components of MVHSM was characterized. Therefore, the role of this subsection is to propose a slight generalization of previous analysis concerning semantics for these components. It is especially crucial for SITL in order to elaborate a coherent facon de parler before introducing the so-called fibred semantics for combined formulae of MVHSM.
In order to elaborate this general glance into semantics for uni-modal SITL-formulae, let us return to satisfaction conditions for HS logic. The corresponding generalized conditions for satisfaction relation for SITL-formulae should be sensitive to the nature of interval relations described by SITL. It is easy to observed that we deal with the same scheme of an initial interval and its subintervals independently of the type of relation . We can also put aside the nature of these intervals (In fact, it is no matter whether they are discrete or continuous. They should only form subintervals of the initial one.). However, we can venture to divide all SITL relations into two classes.
The first class contains explicit ♦-and -type operators G * (F * ), for * ∈ {A, T, I}. Let us denote them collectively for the use of this section's analysis by ♦ * SITL and * SITL . The second class contains a couple of distinguished relations { f inish, begin, keep, halt} of an implicitly modal nature (because of conditions (7)-(9)). As observed previously in Section II, different semantic conditions determine satisfaction for these two classes of SITL modal formulae. This fact finds its reflection in the following generalized satisfaction conditions for SITL-formulae.
M * , I |= X φ iff there is such an interval I that (I ⊆ * I and I X I and M * , I |= φ and 2.
M * , I |= [X]φ iff for all intervals I that (I ⊆ * I and I X I and M * , where * is either T or I. Obviously, dependently on the relation, ⊆ is a unique type. For 'halt'-because of its representation in terms of G T operator-we deal with ⊆ T . 'Finish' is referred to (1) because fin is defined by F T operator (see: condition (9)).
M * , I |= * SITL φ iff for all intervals I that (I ⊆ * I and M * , I |= φ, where * ∈ {A, I, T}. For establishing a corresponding more general Kripke interval model for the fusion MVer⊗HSM (Let us repeat that the fusion does not contain combined formulae.)-it remains to define the appropriate assignment function h : L(MVer⊗ ITL) → 2 S for each modal operator (of this fusion language). It is convenient to define h inductively as follows.
It allows us to define Kripke interval models for the fusion language L(MVer ⊗ ITL). For simplicity of further analysis, let us establish a single symbol X * for an arbitrary SITL relation (Moszkowski's relation) being either X relation (begin, f inish, keep, halt) or an accessibility relation ⊆ * , f or * ∈ {A, I, T}. They will be simply called 'SITL relations'. Definition 13. (Kripke interval model for L(MVer ⊗ ITL)) A Kripke interval model associated to A for L(MVer ⊗ ITL) is each structure of the form: where, for each i ∈ A, α ∈ [0, 1]: • S = ∅ is a model universe consisting of finite intervals (Let us note that we do not specify how the intervals are obtained and what is their nature (discrete or continuous). Paradoxically, it allows us to simplify the definition by considering a common model universe S as a reservoir of all integrals, so we decided for such a solution. It may be problematic for fibred models, where combined formulae are interpreted.), • α i is defined by (13), X * is a SITL-relation, Y-an Allen's relation, • h is a truth assignment function defined as in Definition 12.
Obviously, all the relations α i , relations X * 's and Y's relations of Allen are accessibility relations between intervals. If a Kripke frame, say F , is given, then a Kripke interval model (over F ) forms a pair F , h , where h is a truth assignment defined as previously.
Finally, one could also distinguish Kripke interval models for the components MVer and HSM taken separately. Thus, let us assume that F 1 and F 2 and F 3 are Kripke frames for MVer, SITL and HS (resp.), i.e., F 1 = S, α i , for i ∈ A and α as previously, F 2 = S, X * , where X * is a SITL relation, and F 3 = S, Y , where Y is an Allen's relation. In order to create Kripke models from them, it is enough to establish the corresponding assignments: h 1 = h| MVer , h 2 = h| SITL , h 3 = h| HS (resp.) -each of them obtained from h assignment restricted to the appropriate sets of formulae. Hence, M 1 = F 1 , h 1 , M 2 = F 2 , h 2 , and M 3 = F 3 , h 3 .

Fibred Semantics for Combined Formulae of MVHSM
It is easy to see that Kripke interval models, such as M 1 , M 2 or M 3 above, are not suitable for combined formulae. In fact, they are adapted to interpret uni-modal formulae of the MVHSM system only. One can expect that a remedy for this difficulty might be the appropriate form of the so-called fibred semantics (The fibred semantics is alternatively called 'fibring semantics.')-recently described for a point-wise semantics by D. Gabbay and V. Shehtman in [24]. The founding idea of fibred semantics itself may be informally expressed as follows. If you cannot interpret a combined multi-modal formula φ of a given language in a model, say M (i.e., M cannot properly 'recognize' this formula), then: • find models, in which φ may be interpreted (they can properly recognize this formula) and • built a connection between these models and the initial model M and • accept that if φ is satisfied in all these models, it is also satisfied in M itself.
In this subsection, we shall demonstrate how the mechanism of the fibred semantics works for combined modalities of MVHSM, which cannot single models cannot model. Hence, we intend to propose an extrapolation reconstruction of Gabbay's fibred semantics for the interval-based semantics. In more formal terms, the main idea of fibred semantics for interval-based semantics will be as follows.
I. The frame of fibred semantics for interval-based semantics. Let us assume that a modal-language L (Let us note that we do not impose any restriction on L to be a multimodal language.), and let M 1 be a Kripke interval model for L with a universe S. Let also assume that we intend to evaluate a modal-type formula φ (dually: ♦φ) of another modal language, say L * . Let us assume that φ ∈ L, i.e., M 1 cannot usually interpret φ as it cannot properly 'recognize' it (as the modal formula with -operator).
In order to make the problem M 1 |= φ decidable-we empower the model M 1 to be capable of interpreting φ as follows.
Associate I 1 to a new pair (M I 1 2 , I 2 ), for I 2 ∈ M I 1 2 (M I 1 2 is parametrized by I 1 ).

3.
If it is possible-associate I 1 to each such pair (M i , In other words, for a given interval I 1 from a model M 1 , establish a fibring mapping F: Establish finally a new (conditional) satisfiability for φ in M 1 as follows: for I i ∈ M i as above.
Since F: I 1 → k i=2 (M i , I i ), one can reformulate condition (17) to the following one: for I i ∈ M i as previously.
Being equipped with the new formal machinery to interpret combined formulae, we can return to our motivating example, where an agent's epistemic behavior during its supervision of the loading phase in digital circuits was described by Formula (3).
We intend to interpret the combined multi-modal components of this formula semantically.
The Motivating Example 2. Let us return to the situation of our agent supervising some fragment of 'loading phase' action. It has been established that the statement: "An agent i verifies with a degree α that always later (the situation): 'initially was H and finally' status=1" occurred" may be rendered by the combined multi-modal Formula (3): Illustrate how to semantically model the combined multi-modal formula: (For simplicity of explanation, we decide to avoid the second internal atomic subformula Init(H). Obviously, it does not change the interpretation approach.).
Solution. 0.Pre-processing: Let us consider a (slightly more general) formula is an arbitrary HS-modal operator. Obviously, φ ∈ L(MV HSM)-due to Definition 11. We should establish the initial modeling situation as coherent with the procedure of the fibred semantics construction now. Thus, let M 1 be a model (of a universe S) not capable of recognizing φ as a tri-modal formula of L(MV HSM). In other words, M 1 interprets φ not as V α i [Y]fin(φ) (with φ atomic), but as a unimodal V α i p (with p = [Y]fin(ψ as atomic).
Because of the complexity of φ further construction of fibred semantics must be twostage. In the first stage, we empower M 1 to correctly recognize the next external modal HS-operator [Y]. In the second one, we deliver the model a capability to recognize ITLoperator fin. Thus, let us establish an interval I 1 ∈ S and associate I 1 to a new pair (M I 1 2 , I 2 ), for I 2 ∈ S * via the fibring mapping F such that: F(I 1 ) = (M I 1 2 , I 2 ). Due to point (4) of the construction algorithm-let us establish the (conditional) satisfiability for [Y]ψ in model M 1 , for ψ-as atomic for this model, as follows: (Note that F(F(I 1 )) is a new interval in M 3 associated to I 2 via F -as I 2 was associated to I 1 via F. Thus, we need a doubleF.) Summing up: the tri-modal formula φ may be evaluated in M 1 because of supporting models M 2 (where HS-subformula is evaluated) and M 3 (where SITL-subformula may be evaluated) and their connections with M 1 by means of fibred mapping F (Here and in each place later, we will understand the fibring mapping F as a mapping completely determined by conditions (3) and (4) of the fibred semantics construction. Therefore, we do not impose any restrictive limitations on it. However, it is sometimes convenient to adopt the "switching condition" for F: for each I ∈ M 1 , it holds F(I) ∈ M 2 and for each I ∈ M 2 : F(I) ∈ M 1 . Finally, if I 1 = I 2 , than also F(I 1 ) = F(I 2 )-due to [24]. Let us note that F must not necessarily be a function.).
Establishing this condition finishes the procedure. In many cases.

II. The fibred Kripke models.
Having described a construction frame of interval fibred semantics, we can venture to introduce a detailed definition of fibred Kripke models for MVHSM on a base of the models earlier introduced. All components of this logic system should be considered. Since we want to preserve information about the initial provenance of all components in the new model (about domains, relations, and assignment functions), we venture to exploit an algebraic concept of a simple sum in its definition. Because of the unique role of fibring mappings in the evaluation process, they will be singled out as separate components of the fibred Kripke models.
It leads to the following definition of the fibred Kripke model.
for some assignment h 2 for HS-formulae.

Model for the SITL-temporal component.
In the similar way, we are in a position to find a model for SITL-temporal component. Because the situation described by 'fin(status = 1)' we need the following pair of intervals: • J, where 'fin(status = 1) is expressed and • J * as a final subinterval of J, where 'status = 1' holds The appropriate model for SITL-component of (22) is the tuple: where: F is a fibring mapping (By default, F connects M 1 with M 2 , and M 2 with M 3 .). In this way, the Formula (19) describing a piece of agent reasoning about digital circuits found is a semantic reflection in fibred Kripke semantics for the MVHSM system.

In a Broader Context of the Model Checking Problem
Although the logical approach to reasoning about digital circuits has a prototype character, it seems reasonable to locate it from a broader perspective.

The Paper Ideas and Research on Digital Circuits
It has been already said that ITL from [4] found its application in a formal representation of different digital circuits of the arithmetic and combinational type, such as adders (see: [4], pp. 55-64) or multipliers (see: [4], pp. 86-88). The formal apparatus of ITL may also be exploited for the use of formal representing the data handling combinational circuits, such as Multiplexer (see: [4], pp. 86-88) and many others. Obviously, the ITL formulae describing the behavior and properties of these computational circuits-as unique formulae of (an appropriate description-logic based extension of MVHSM)-may be interpreted in the Kripke interval models just proposed. It is noteworthy that the unary specific predicate LoadPhase()-exploited in our motivating example-supports a formal representation of the behavior of other types of data-handling computational circuits, such as Implementation (close related to Multiplier)-due to definition (LoadPhase(H) is defined as previously in the paper body, and MultiPhase(H) is defined in the following way.
Due to- [4], p. 109-a behaviour of 'MultiPhase' may be explained as follows. When the load signal is inactive at 0 (Ld ≈ 0) and the device has Status=1 (is steady), the circuit can be clocked to perform a single iteration. The algorithm's predicate runs over two clock cycles. Afterwards, the device is always again steady with Status equaling 1 ([4] p. 109)): ∧MultiPhase(H)).
Its behaviour should be understood as follows. The device's fields are shown by lmp-Structure. The predicate LoadPhase specifics device operation for initially loading the inputs. Once this is achieved, the predicate MultiPhase indicates how to perform the individual multiplication steps (see: [4], p. 107.) Obviously, one can also imagine the situation of much more complicated formulae of (an appropriate extension of MVHSM) to be capable of rendering the constitutive behavioral properties of many other digital circuits. The fibred semantics-just elaborated-delivers us a general frame for their semantic interpretation.
A natural question arises: how to refer the ideas to the newest types of digital circuits. They are usually represented by a broad spectrum of processors, microprocessors, or sophisticated flip-flop-based registers and designed due to limitations and deeply explored capabilities of VHDL specification. They form a far enhancement of the classical and basic digital circuits as adders, counters, or single flip-flops. (See: [37].) It seems that its sophisticated nature might elude the formalization efforts, such as in terms of MVHSM and its appropriate extensions. Meanwhile, a deeper look at the development tendencies in research on digital circuits delivers a piece of optimism in this matter. Indeed, they include such research trends as estimating and reducing resource usage, producing faster circuits, improving processor performance, etc. It seems that these deeply engineering problems and issues do not essentially impose any new restrictions on our formalization attempt concerning the initial Moszkowski's ones from [4,5] for (at least two reasons). First, they have another semantic field, and they require another non-logic-based methodology to be solved. Secondly, our approach suggests how to move from formal modeling of basic circuits (such as single flip-flops) to modeling their multi-collections (such as processors). We need a mapping-based connection between our transition systems (of Kripke models for verification of circuit's properties), which preserve the appropriate portion of information moving between the transition systems. Obviously, the small outline of the fibred semantics should be complemented by purely engineering requirements (f.e. imposed on the fibred mappings) to aspire to be a realistic fibred transition system (as a model) for some of the more advanced circuits. Indeed, the transitions system seems to be even more convenient in this role than interval Kripke models. It follows from the fact that they better grasp the internal dynamism of the devices. In addition, they seem to be a convenient semantic 'mediator' between a purely logical system of temporal logic such as LTL, CTL, µ-calculus, ITL, HS, MVHSM, etc., and the purely declarative description languages such as HDS or VHDL.
Nevertheless, one needs to underline that no of these formal languages (even some extensions of MVHSM) can aspire to exchange the specification languages. Indeed, they play slightly another role. The main predestination of the specification languages is a synthesis-based creation of electronic systems. Meanwhile, temporal logic systemsdue [4,7,[16][17][18]38]-should be rather suitable (in the context of digital circuits analysis) for a formal description of different (external or internal) properties of them (such as liveness, lack of deadlock, the appropriate action sequencing). Models of these systems-even if they form transition systems and try to model digital circuits themselves-introduce a piece of an idealization and are more suitable for being well-founded in a mathematical sense. Thanks to this, they potentially form a convenient bridgehead for incorporating a piece of model checking machinery. It seems that some reference to these models (such as fibred models for MVHSM) is necessary if we intend to formally verify some properties of the modern digital circuits (such as processors) even if they have better 'operative' and algorithm-based depiction in terms of VHDL/Python interpreter. Some illustration how the model-checking machinery may be incorporated into the pipelined processor model-expressed in DLX assembly code-may be found in [23].

A Potential Benefit: Combined Model Checking
Indeed, this model-theoretic perspective of our (deceptively pure) logical approach is the model checking-oriented. Namely, in a conceptual frame of our combined logic-based approach, the model checking machinery for digital circuit's behaviour and description may be integrated with model checking for pieces of reasoning about them. Even though our combined Formula (22) forms a simplified case of many other combined formulae for a description of many realistic scenarios of reasoning about digital circuits, its fibred semantics-based modeling illustrates some new possibilities of formal verification for many other similarly combined formulae. It seems to constitute a piece of novelty of the paper in the model checking immersed in electronics-based application contexts-even if the digital circuit properties's and behaviour's description-f.e. against the bounded model checking for microprocessors as in [23]-does not form a leading tendency in model checking speculations for electronics-determined application contexts.
Meanwhile, the general scheme of the model-checking procedures for MVHSM (and its potential extensions) may be given by the following algorithm.
The core of the algorithm is VERIFY function, which returns Boolean (true or false) for a given Kripke model (transition system), an interval and a given formula φ of MVHSM. For combined formulae, VERIFY also depends on fibring function F. It enables of verifying these formulae, which cannot be evaluated in initial models. This algorithm ellucidates at least tow benefits from incorporating the interval fibred semantics to model checking for properties of digital circuits. First, we can integrate a machinery of model checking for properties of digital circuits themselves with model checking for (formally depicted) pieces of reasoning about them (lines 22-25 of Algorithm 1). It draws some new perspectivesalso in the area of automated model checking. Secondly, fibred semantics makes the whole model checking for MVHSM formulae decidable as it ensures the required connections between models. Meanwhile, the number of the procedure steps is finite (there is always a finite number of intervals to check, a set G of α's is also finite). for all J s.t. I α i J do; 14: if VERIFY(M, J, φ , F) then true 15: end if 16: end if 17: if φ = * SIT L φ , for * ∈ {A, T, I} then 18: for all J s.t. I ⊆ * J do; 19: if VERIFY(M, J, φ , F) then true 20: end if 21: end if 22: if φ = [U] α i [Y] * SIT L φ , for * ∈ {A, T, I} then 23: for all J * * * s.t. J * * X * J * * * , for all such J * * that J * Y J * * , for all such J that 24: J α i J * do; 25: if VERIFY(F 3 (M, J), J * * * , φ , F) then true 26: end if 27: end if 28: end procedure

The Results Between Other Concepts
The paper analysis stems from research on interval temporal logic-both its theoretic and application-based aspects. The chronologically first and complex formalization approach to interval temporal logic found its reflection in Interval Temporal Logic of B. Moszkowski from [4,5] as a synthetic depiction of previous and context-dependent attempts from [1][2][3]. In this sense, Moszkowski's system plays a role similar to the so-called Linear Temporal Logic-as a tense logic initially adopted to the area of computer science by A. Pnueli [16]. In this paper, a simplified version of propositional ITL is considered and forms a basis for further synergy construction of the hybrid MVHSM.
The second temporal pillar of the MVHSM system's construction, i.e., Halpern-Shoham Logic, was invented by J. Halpern and Y. Shoham in [7] as a modal-temporal system for the description of Allen's relations between intervals. This system and a variety of its subsystems have been deeply explored in many works, such as [8][9][10][11]). It was made mainly from a perspective of theoretical problems of their satisfiability and model checking complexity. Although the author of the paper shares with the authors of these works the same general philosophy of thinking about HS logic as about a reservoir of the formal system instead of a concrete axiom system, these works did not significantly influence the paper analysis because of their purely metalogical orientation. In addition, a piece of a conceptual tissue of HS depiction was also borrowed from these works.
By contrast, an idea of an epistemic extension of HS from [22] and ideas of Fagin's behavioral semantics from [21] found its reflection in the construction of MVHSM and semantics for its epistemic component MVer for gradable verifiability. Different pre-Gettier's and Gettier's philosophical debates around a concept of knowledge and justification from [28][29][30] delivered a conceptual foundation and added a philosophical gravity to the formalization attempt of gradable verifiability logic MVer. The erudite Smullyan's position ( [39]) explained the author's profound connections between Löb's provability conditions for PA arithmetic and epistemic logic.
This paper analysis may be viewed as a continuation of ideas from [40], where the first epistemic simplified ITL of Moszkowski for justification was introduced, and from [27], where a deontic Halpern-Shoham logic was proposed. These two systems were interpreted in Gabbay's style fibred semantics-initially elaborated in a point-wise variant in [24]. Against common tendencies to built an algebraic semantics for multi-valued and fuzzy systems-as shown in [35]-a relational semantics-based approach dominates in all these hybrid systems.
Finally, one needs to underline that the solution to combined fuzziness (or multivalency) with temporal relations indirectly (via the appropriate multi-valued system) seems to be somehow orthogonal to a current tendency to combine fuzzified temporal relations as made in [41][42][43][44].

Conclusions
In this paper, a unique Multi-Valued Simplified Halpern-Shoham-Moszkowski Logic for Gradable Verifiability has been introduced both syntactically and semantically. In particular, a fibred semantics has been proposed for combined formulae for this system. The analysis has been exemplified by some situations of an agent's reasoning about processes in digital circuits. It was made in some coherence with the initial motivation of Moszkowski from his 'Reasoning about digital circuits.' However, a formal representation of the epistemic excerpt of the agent's situation was put forward for a cost of some simplification of the original ITL of Moszkowski and by some generalization of its interval semantics. It found its reflection in the form of the proposed fibred semantics. Meanwhile, it is reasonable to expect the development of fibred semantics to use another possible (alethic, deontic, or dynamic) extension of Interval Temporal Logic and Knowledge Representation. Perhaps, fibred semantics may be enriched by some epistemic capabilities of agents-considered in behavioral semantics of Fagin. Last but not least, a general conceptual frame of a combined model checking machinery was put forward for both formal properties of digital circuits and fragments of reasoning about them. It seems to be reasonable to develop the machinery of combined model checking to be adaptable to VHDL-based specifications of the newer types of digital circuits.
It seems that further research may be developed not only from a logical and metalogical point of view (in the perspective of problems of complexity, satisfiability, or model checking). Indeed, a quick and still increasing development of different checkers and interpreters (such as Tempura, C-Tempura and Anatempura for running verification of systems using ITL gives a chance to support the purely theoretic researches.
Funding: This research received no external funding.