Abstract

Transition systems are often specified by operational rules in GSOS format, the models of which are known to be well behaved in many respects. Turi and Plotkin have shown a close relation between such rule sets and their models on the one hand and natural transformations of a certain shape and a class of bialgebras they identify on the other hand. Since the latter formulation generalises the format to arbitrary types of systems, they called it abstract GSOS.

Citations

371	A.: Bisimulation through Probabilistic Testing - Larsen, Skou - 1991
214	A Tutorial on (Co)Algebras and (Co)Induction - Jacobs, Rutten - 1997
169	Bisimulation Can’t Be Traced - Bloom, Istrael, et al. - 1995
156	N.: A Final Coalgebra Theorem - Aczel, Mendler - 1989
102	Structural operational semantics - Aceto, Fokkink, et al.
85	The Logic of - Baltag, Moss, et al. - 1998
69	Bisimulation for probabilistic transition systems: A coalgebraic approach - Vink, Rutten - 1999
54	W.: Probabilistic extensions of process algebras - Jonsson, Larsen, et al. - 2001
37	Compositional Verification of Probabilistic Processes - Larsen, Skou - 1992
22	Distributivity for Endofunctors, Pointed and Co-pointed Endofunctors, Monads and Comonads - Lenisa, Power, et al. - 2000
15	Generalised coinduction - Bartels
9	Coalgebraic modelling of timed processes - Kick - 2007
7	Rule formats for timed processes - Kick - 2002
1	GSOS for probabilistic transition systems (extended abstract - Bartels - 2002