modulation-reaction logic

This study investigates the evolution of truth values of Computation Tree Logic (CTL) properties during abstraction refinement. To this end, it systematically introduces modal logic into the abstraction refinement framework for the first time, enriching the semantics with two new modal operators: ◇ (indicating that some refinement satisfies a property) and □ (indicating that all refinements satisfy it), thereby capturing the notions of possibility and necessity in refinement. Building on control statements, the work proposes a general technique for proving upper bounds and establishes tight upper and lower bounds for modal CTL across three canonical settings—finite abstractions, the full abstraction lattice, and complete transition systems—providing both a theoretical foundation and analytical tools for reasoning about property preservation across abstraction levels in formal verification.

This work addresses runtime monitoring of modal μ-calculus over infinite-domain data systems, focusing on specification and verification of data-flow properties. Methodologically, it introduces a data-enriched modal μ-calculus, integrating first-order predicates, register automata with guessing capabilities, and monitor synthesis algorithms. The study establishes the first rigorous monitorability hierarchy for this logic; proves that deterministic monitors strictly reduce expressive power; identifies the fragment without greatest fixed points as precisely characterizing all monitorable formulas; and shows that no decidable and complete monitorable sublogic exists for the full logic. Contributions include: (i) a formal characterization of the theoretical limits of data-aware monitoring, (ii) the undecidability of completeness for monitorability in data logics, and (iii) a framework for monitor construction that balances theoretical soundness with engineering feasibility.

Existing MITL verification approaches either support only fragment logics or lack completeness guarantees. Method: This paper proposes a complete satisfiability checking and model-checking framework for Metric Interval Temporal Logic with Past and Present (MITPPL). It introduces symbolic transition encoding and symmetry reduction techniques to drastically compress the reachable state space, achieving exponential performance gains. MITPPL formulas are compiled into networks of timed automata—or equivalently, single timed automata—using pointwise semantics, ensuring seamless integration with mainstream tools including Uppaal, TChecker, and LTSmin. Contribution/Results: The resulting toolchain supports multicore parallel model checking and precisely verifies language equivalence over both finite and infinite words. To the best of our knowledge, this is the first framework enabling efficient and complete verification of the full MITPPL logic.

This work proposes the first model checking approach for CTL* temporal logic tailored to infinite families of finite-state transition systems generated by highly configurable systems or software product lines. The method employs context-free graph grammars to uniformly model the entire system family and introduces a grammar-rule-based, compositional state labeling algorithm. This algorithm recursively propagates state labels using only finite contextual information, enabling the verification of whether all, some, or infinitely many members of the family satisfy a given CTL* property. Experimental results demonstrate that the approach effectively supports unified formal verification across infinite system families, offering a scalable solution for reasoning about complex configurable systems within a rigorous logical framework.

This paper addresses the model checking problem for Metric Interval Temporal Logic (MITL) under pointwise semantics with past-tense operators. We propose the first efficient deterministic construction of timed automata supporting past modalities. Our method compiles the MITL past fragment into a network of deterministic timed automata in linear time, then extends it to full MITL—including both future and past modalities—via synchronized event-clock automata augmented with shared variables and future clocks, yielding a deterministic generalized timed automaton. To handle both finite and infinite traces uniformly, we integrate a liveness analysis algorithm based on strongly connected components. Experimental evaluation on 72 benchmark formulas and two classical real-time systems demonstrates end-to-end pointwise-semantics model checking, achieving significant performance improvements over state-of-the-art approaches.

This work addresses the challenges of transferability and computational feasibility in discrete abstraction for symbolic model checking of cyber-physical systems by proposing a conservatism-first, four-step modular workflow to construct finite-state abstractions of closed-loop dynamical systems. The approach integrates state partitioning, conservative transition construction, spurious behavior elimination, and specification semantics lifting, enabling composable and replaceable subroutine design. Transition relations are built using axis-aligned bounding boxes, polyhedra, and sampling with PAC coverage certificates, combined with certified erasure and counterexample-guided refinement. Reliable lifting of LTL specifications is achieved through may–must semantics. Evaluation across three case studies demonstrates that the workflow effectively balances abstraction accuracy and verification efficiency while clearly revealing the impact of different design choices on the outcomes.

MightyPPL工具扩展了MITL模型检测，首次支持MTL属性及Pnueli和Past模态，通过改进架构实现了更优性能。

This study addresses the limitations in verifying high-order Petri net structural invariants within symmetric nets, which are currently restricted to specific subclasses. To overcome this, we propose an extended formal definition of symmetric nets that satisfies closure under fundamental operators, thereby establishing a more general invariant verification framework. Methodologically, this work integrates symbolic reachability graphs, discrete-event simulation, and formal calculus, leveraging the SNexpression tool to precisely compute symbolic structural relationships. Consequently, the proposed approach enables the semi-automatic verification of structural invariants, including (semi)flows, as well as flow family generation. The theoretical feasibility and the validity of the core concepts are demonstrated through representative examples.

本文通过引入基于多面体语义和路径空间可达性算子的时空多面体可达性逻辑，解决了动态拓扑逻辑中的问题，并证明了其在可逆动力系统中的健全性和完备性。

This study addresses the challenges of structural analysis in high-level Petri nets and the limitation of symmetric net invariant verification to restricted subclasses. It proposes a semi-automated method for verifying symbolic structural invariants within extended symmetric nets. By applying symbolic structural calculus to a formal framework closed under key functional operators, this work constructs a generating family framework focused on flow relations. Verification is achieved using the SNexpression tool, symbolic reachability graphs, lumped Markov chains, and conflict causality calculus. The research establishes a theoretical verification framework applicable to broader invariant properties and validates its core concepts through representative examples, significantly extending the applicability of invariant analysis.