Incremental Pattern-Based Coinduction for Process Algebra and Its Isabelle Formalization

  • Andrei Popescu
  • Elsa L. Gunter
Conference paper

DOI: 10.1007/978-3-642-12032-9_9

Part of the Lecture Notes in Computer Science book series (LNCS, volume 6014)
Cite this paper as:
Popescu A., Gunter E.L. (2010) Incremental Pattern-Based Coinduction for Process Algebra and Its Isabelle Formalization. In: Ong L. (eds) Foundations of Software Science and Computational Structures. FoSSaCS 2010. Lecture Notes in Computer Science, vol 6014. Springer, Berlin, Heidelberg

Abstract

We present a coinductive proof system for bisimilarity in transition systems specifiable in the de Simone SOS format. Our coinduction is incremental, in that it allows building incrementally an a priori unknown bisimulation, and pattern-based, in that it works on equalities of process patterns (i.e., universally quantified equations of process terms containing process variables), thus taking advantage of equational reasoning in a “circular” manner, inside coinductive proof loops. The proof system has been formalized and proved sound in Isabelle/HOL.

Copyright information

© Springer-Verlag Berlin Heidelberg 2010

Authors and Affiliations

  • Andrei Popescu
    • 1
  • Elsa L. Gunter
    • 1
  1. 1.University of Illinois at Urbana-Champaign 

Personalised recommendations