Axiomatizing GSOS with Predicates

Details Axiomatizing GSOS with Predicates Axiomatizing GSOS with Predicates

2011-08-16

arxiv.org/abs/1108.3124v1

EPTCS 62, 2011, pp. 1-15

Computer Science

Logic in Computer Science

In Proceedings SOS 2011, arXiv:1108.2796

Scientific paper

10.4204/EPTCS.62.1

In this paper, we introduce an extension of the GSOS rule format with predicates such as termination, convergence and divergence. For this format we generalize the technique proposed by Aceto, Bloom and Vaandrager for the automatic generation of ground-complete axiomatizations of bisimilarity over GSOS systems. Our procedure is implemented in a tool that receives SOS specifications as input and derives the corresponding axiomatizations automatically. This paves the way to checking strong bisimilarity over process terms by means of theorem-proving techniques.

Affiliated with

Also associated with

No associations

Rating

Axiomatizing GSOS with Predicates does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Axiomatizing GSOS with Predicates, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Axiomatizing GSOS with Predicates will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-194556