Syntactic Formats for Free

Klin, Bartek; Sobociński, Paweł

doi:10.1007/978-3-540-45187-7_5

Cited by 2 publications

(1 citation statement)

References 14 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Most of them study the question in a rather coalgebraic framework [JH03,KS03,Kli04,Jac04] and, in many cases, are based on relatively complex categorical concepts. These works aim generality and their results are rather general, but just because of that the machinery to apply them in particular cases can be rather complex.…”

Section: Introductionmentioning

confidence: 99%

Bisimulations Up-to for the Linear Time Branching Time Spectrum

Frutos-Escrig

Rodríguez

2005

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. Coinductive definitions of semantics based on bisimulations have rather pleasant properties and are simple to use. In order to get coinductive characterisations of those semantic equivalences that are weaker than strong bisimulation we use a variant of the bisimulation up-to technique in which we allow the use of a given preorder relation. We prove that under some technical conditions our bisimulations up-to characterise the kernel of the given preorder. It is remarkable that the adequate orientation of the ordering relation is crucial to get this result. As a corollary, we get nice coinductive characterisations of all the axiomatic semantic equivalences in Van Glabbeek's spectrum. Although we first prove our results for finite processes, reasoning by induction, then we see, by using continuity arguments, that they are also valid for infinite (finitary) processes.

show abstract

Section: Introductionmentioning

confidence: 99%