A compositional \(\mu\)-calculus proof system for statecharts processes

DOI10.1016/S0304-3975(97)00245-4zbMath0914.68179MaRDI QIDQ1285661

Francesca Levi

Publication date: 28 April 1999

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

\(\mu\)-calculuscompositional verificationstatecharts

Mathematics Subject Classification ID

Related Items (2)

What Is in a Step: New Perspectives on a Classical Question ⋮ Reconciling statechart semantics

Uses Software

• Coq

Cites Work

• Compositional checking of satisfaction
• Results on the propositional \(\mu\)-calculus
• Calculi for synchrony and asynchrony
• Statecharts: a visual formalism for complex systems
• Tableau-based model checking in the propositional mu-calculus
• A note on model checking the modal \(\nu\)-calculus
• Local model checking in the modal mu-calculus
• A compositional axiomatization of statecharts
• The Esterel synchronous programming language: Design, semantics, implementation
• Model checking and boolean graphs
• What is in a step: On the semantics of statecharts
• Equivalences of Statecharts
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A compositional \(\mu\)-calculus proof system for statecharts processes