On global induction mechanisms in aμ-calculus with explicit approximations
From MaRDI portal
Publication:4460690
DOI10.1051/ita:2003024zbMath1111.68518MaRDI QIDQ4460690
Publication date: 29 March 2004
Published in: RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)
Full work available at URL: http://www.numdam.org/item?id=ITA_2003__37_4_365_0
68Q60: Specification and verification (program logics, model checking, etc.)
03B35: Mechanization of proofs and logical operations
03F07: Structure of proofs
Related Items
Sequent calculi for process verification: Hennessy-Milner logic for an arbitrary GSOS, Extracting Proofs from Tabled Proof Search, Cyclic Arithmetic Is Equivalent to Peano Arithmetic
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Games for the \(\mu\)-calculus
- Results on the propositional \(\mu\)-calculus
- Local model checking in the modal mu-calculus
- Local model checking for infinite state spaces
- Finiteness is mu-ineffable
- Proving properties of dynamic process networks
- Modalities for model checking: Branching time logic strikes back
- -Calculus with Explicit Points and Approximations