A Generalization of Equational Proof Theory?

Olivier Bournez 1
1 PROTHEO - Constraints, automatic deduction and software properties proofs
INRIA Lorraine, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
Abstract : Recently rule based languages focussed on the use of rewriting as a modeling tool which results in making specifications executable. To extend the modeling capabilities of rule based languages, we explored in a previous work the possibility of making the rule applications subject to probabilistic choices, and started to study the generalization of the results in the rewriting community about abstract reduction systems to systems with probabilistic choices. This paper presents a new contribution on this line by presenting a generalization of classical equational proof theory. We obtain a nice proof theory which is sound and complete, and which has initial models.
Type de document :
Communication dans un congrès
H. Hermanns, R. Segala. Second Joint International Workshop on Process Algebras and Performance Modeling / Probabilistic Methods In Verification - PAPM-PROBMIV'02, Jul 2002, Copenhagen, Denmark, Springer, 2399, pp.207-208, 2002, Lecture Notes in Computer Science
Liste complète des métadonnées

https://hal.inria.fr/inria-00100885
Contributeur : Publications Loria <>
Soumis le : mardi 26 septembre 2006 - 14:52:41
Dernière modification le : jeudi 11 janvier 2018 - 06:19:57

Identifiants

  • HAL Id : inria-00100885, version 1

Collections

Citation

Olivier Bournez. A Generalization of Equational Proof Theory?. H. Hermanns, R. Segala. Second Joint International Workshop on Process Algebras and Performance Modeling / Probabilistic Methods In Verification - PAPM-PROBMIV'02, Jul 2002, Copenhagen, Denmark, Springer, 2399, pp.207-208, 2002, Lecture Notes in Computer Science. 〈inria-00100885〉

Partager

Métriques

Consultations de la notice

63