Towards automated proofs of observational properties - Archive ouverte HAL
Journal Articles Discrete Mathematics and Theoretical Computer Science Year : 2004

Towards automated proofs of observational properties

Abstract

Observational theories are a generalization of first-order theories where two objects are observationally equal if they cannot be distinguished by experiments with observable results. Such experiments, called contexts, are usually infinite. Therfore, we consider a special finite set of contexts, called cover-contexts, ''\emphcovering'' all the observable contexts. Then, we show that to prove that two objects are observationally equal, it is sufficient to prove that they are equal (in the classical sense) under these cover-contexts. We give methods based on rewriting techniques, for constructing such cover-contexts for interesting classes of observational specifications.
Fichier principal
Vignette du fichier
dm060201.pdf (116.25 Ko) Télécharger le fichier
Origin Files produced by the author(s)
Loading...

Dates and versions

hal-00959001 , version 1 (13-03-2014)

Identifiers

Cite

Narjes Berregeb, Riadh Robbana, Ashish Tiwari. Towards automated proofs of observational properties. Discrete Mathematics and Theoretical Computer Science, 2004, Vol. 6 no. 2 (2), pp.143-162. ⟨10.46298/dmtcs.331⟩. ⟨hal-00959001⟩

Collections

TDS-MACS
70 View
903 Download

Altmetric

Share

More