PREG axiomatizer: a ground bisimilarity checker for GSOS with predicates

Authors:
Luca Aceto;Georgiana Caltais;Eugen-Ioan Goriac;Anna Ingolfsdottir
Affiliations:
ICE, TCS, School of Computer Science, Reykjavik University, Iceland;ICE, TCS, School of Computer Science, Reykjavik University, Iceland;ICE, TCS, School of Computer Science, Reykjavik University, Iceland;ICE, TCS, School of Computer Science, Reykjavik University, Iceland
Venue:
CALCO'11 Proceedings of the 4th international conference on Algebra and coalgebra in computer science
Year:
2011

Citing 10
Cited 0

Process algebra

Process algebra
Turning SOS rules into equations

Information and Computation
Bisimulation can't be traced

Journal of the ACM (JACM)
Communication and Concurrency

Communication and Concurrency
Term Rewriting Properties of SOS Axiomatisations

TACS '94 Proceedings of the International Conference on Theoretical Aspects of Computer Software
Deriving Complete Inference Systems for a Class of GSOS Languages Generation Regular Behaviours

CONCUR '94 Proceedings of the Concurrency Theory
Maude MSOS Tool

Electronic Notes in Theoretical Computer Science (ENTCS)
Prototyping SOS Meta-theory in Maude

Electronic Notes in Theoretical Computer Science (ENTCS)
Process Algebra: Equational Theories of Communicating Processes

Process Algebra: Equational Theories of Communicating Processes
All about maude - a high-performance logical framework: how to specify, program and verify systems in rewriting logic

All about maude - a high-performance logical framework: how to specify, program and verify systems in rewriting logic

Quantified Score

Hi-index	0.00

Visualization

Abstract

PREG Axiomatizer is a tool used for proving strong bisimilarity between ground terms consisting of operations in the GSOS format extended with predicates. It automatically derives sound and ground-complete axiomatizations using a technique proposed by the authors of this paper. These axiomatizations are provided as input to the Maude system, which, in turn, is used as a reduction engine for provided ground terms. These terms are bisimilar if and only if their normal forms obtained in this fashion are equal. The motivation of this tool is the optimized handling of equivalence checking between complex ground terms within automated provers and checkers.