Extensible Proof Systems for Infinite-State Systems
Abstract
This article revisits soundness and completeness of proof systems for proving that sets of states in infinite-state labeled transition systems satisfy formulas in the modal mu-calculus in order to develop proof techniques that permit the seamless inclusion of new features in this logic. Our approach relies on novel results in lattice theory, which give constructive characterizations of both greatest and least fixpoints of monotonic functions over complete lattices. We show how these results may be used to reason about the sound and complete tableau method for this problem due to Bradfield and Stirling. We also show how the flexibility of our lattice-theoretic basis simplifies reasoning about tableau-based proof strategies for alternative classes of systems. In particular, we extend the modal mu-calculus with timed modalities, and prove that the resulting tableau method is sound and complete for timed transition systems.
Document Details
- Document Type
- Pub Defense Publication
- Publication Date
- Nov 18, 2023
- Source ID
- 10.1145/3622786
Entities
People
- Jeroen J. A. Keiren
- Rance Cleaveland
Organizations
- Eindhoven University of Technology
- National Science Foundation
- Office of Naval Research
- University of Maryland