GENERALIZING DETERMINIZATION FROM AUTOMATA TO COALGEBRAS

Transcription

1 Logicl Methods in Computer Science Vol. 9(1:09)2013, pp Submitted Jun. 16, 2011 Published Mr. 4, 2013 GENERALIZING DETERMINIZATION FROM AUTOMATA TO COALGEBRAS ALEANDRA SILVA, FILIPPO BONCHI b, MARCELLO BONSANGUE c, AND JAN RUTTEN d Rdboud University Nijmegen nd Centrum Wiskunde & Informtic e-mil ddress: ms@cwi.nl b ENS Lyon, Université de Lyon, LIP (UMR 5668 CNRS ENS Lyon UCBL INRIA) e-mil ddress: filippo.bonchi@ens-lyon.fr c LIACS - Leiden University e-mil ddress: mrcello@lics.nl d Centrum Wiskunde & Informtic nd Rdboud University Nijmegen e-mil ddress: jnr@cwi.nl Abstrct. The powerset construction is stndrd method for converting nondeterministic utomton into deterministic one recognizing the sme lnguge. In this pper, we lift the powerset construction from utomt to the more generl frmework of colgebrs with structured stte spces. Colgebr is n bstrct frmework for the uniform study of different kinds of dynmicl systems. An endofunctor F determines both the type of systems (F-colgebrs) nd notion of behviourl equivlence ( F) mongst them. Mny types of trnsition systems nd their equivlences cn be cptured by functor F. For exmple, for deterministic utomt the derived equivlence is lnguge equivlence, while for non-deterministic utomt it is ordinry bisimilrity. We give severl exmples of pplictions of our generlized determiniztion construction, including prtil Mely mchines, (structured) Moore utomt, Rbin probbilistic utomt, nd, somewht surprisingly, even pushdown utomt. To further witness the generlity of the pproch we show how to chrcterize colgebriclly severl equivlences which hve been object of interest in the concurrency community, such s filure or redy semntics ACM CCS: [Theory of computtion]: Models of computtion Abstrct mchines & Forml lnguges nd utomt theory Formlisms Algebric lnguge theory & Semntics nd resoning Progrm semntics Ctegoricl semntics. Key words nd phrses: Colgebrs, Powerset Construction, Liner Semntics. The work of Alexndr Silv is prtilly funded by the ERDF through the Progrmme COMPETE nd by the Portuguese Foundtion for Science nd Technology, project ref. PTDC/EIA-CCO/122240/2010 nd SFRH/BPD/71956/2010. b The work of Filippo Bonchi is supported by the CNRS PEPS project CoGIP nd the project ANR 12IS02001 PACE. c,d The reserch of Mrcello Bonsngue nd Jn Rutten hs been crried out under the Dutch NWO project CoRE: Coinductive Clculi for Regulr Expressions., dossier number LOGICAL METHODS Ð IN COMPUTER SCIENCE DOI: /LMCS-9(1:09)2013 c A. Silv, F. Bonchi, M. Bonsngue, nd J. Rutten CC Cretive Commons

2 2 A. SILVA, F. BONCHI, M. BONSANGUE, AND J. RUTTEN Introduction Colgebr is by now well estblished generl frmework for the study of the behviour of lrge clsses of dynmicl systems, including vrious kinds of utomt (deterministic, probbilistic etc.) nd infinite dt types (strems, trees nd the like). For functor F: Set Set, n F-colgebr is pir (,f), consisting of set of sttes nd function f: F() defining the observtions nd trnsitions of the sttes. Colgebrs generlly come equipped with stndrd notion of equivlence clled F-behviourl equivlence tht is fully determined by their (functor) type F. Moreover, for most functors F there exists finl colgebr into which ny F-colgebr is mpped by unique homomorphism tht identifies ll F-equivlent sttes. Much of the colgebric pproch cn be nicely illustrted with deterministic utomt (DA), which re colgebrs of the functor D() = 2 A. In DA, two sttes re D- equivlentpreciselywhentheyccept thesmelnguge. Theset2 A ofllformllnguges constitutes finl D-colgebr, into which every DA is mpped by homomorphism tht sends ny stte to the lnguge it ccepts. It is well-known tht non-deterministic utomt (NDA) often provide more efficient (smller) representtions of forml lnguges thn DA s. Lnguge cceptnce of NDA s is typiclly defined by turning them into DA s vi the powerset construction. Colgebriclly this works s follows. NDA s re colgebrs of the functor N() = 2 P ω () A, where P ω is the finite powerset. An N-colgebr (,f: 2 P ω () A ) is determinized by trnsforming it into D-colgebr (P ω (),f : P ω () 2 P ω () A ) (for detils see Section 2). Then, the lnguge ccepted by stte s in the NDA (,f) is defined s the lnguge ccepted by the stte s} in the DA (P ω (),f ). For second vrition on DA s, we look t prtil utomt (PA): colgebrs of the functor P() = 2 (1+) A, where for certin input letters trnsitions my be undefined. Agin, one is often interested in the DA-behviour (i.e., lnguge cceptnce) of PA s. This cn be obtined by turning them into DA s using totliztion. Colgebriclly, this mountstothetrnsformtionofp-colgebr(,f: 2 (1+) A )intod-colgebr (1+,f : 1+ 2 (1+) A ). Although the two exmples bove my seem very different, they re both instnces of one nd the sme phenomenon, which it is the gol of the present pper to describe t generl level. Both with NDA s nd PA s, two things hppen t the sme time: (i) more (or, more generlly, different types of) trnsitions re llowed, s consequence of chnging the functor type by replcing by P ω () nd (1+), respectively; nd (ii) the behviour of NDA s nd PA s is still given in terms of the behviour of the originl DA s (lnguge cceptnce). For lrge fmily of F-colgebrs, both (i) nd (ii) cn be cptured simultneously with the help of the ctegoricl notion of mond, which generlizes the notion of lgebric theory. The structuring of the stte spce cn be expressed s chnge of functor type from F() to F(T()). In our exmples bove, both the functors T 1 () = P ω () nd T 2 () = 1+ re monds, nd NDA s nd PA s re obtined from DA s by chnging the originl functor type D() into N() = D(T 1 ()) nd P() = D(T 2 ()). Regrding (ii), one ssigns F-semntics to n FT-colgebr (,f) by trnsforming it into n F-colgebr (T(),f ), gin using the mond T. In our exmples bove, the determiniztion of NDA s nd the totliztion of PA s consists of the trnsformtion of N- nd P-colgebrs (,f) into D-colgebrs (T 1 (),f ) nd (T 2 (),f ), respectively.

3 GENERALIZING DETERMINIZATION FROM AUTOMATA TO COALGEBRAS 3 We shll investigte generl conditions on the functor types under which the bove constructions cn be pplied: for one thing, one hs to ensure tht the FT-colgebr mp f: F(T()) induces suitble F-colgebr mp f : T() F(T()). Our results will led to uniform tretment of ll kinds of existing nd new vritions of utomt, tht is, FT-colgebrs, by n lgebric structuring of their stte spce through mond T. Furthermore, we shll prove number of generl properties tht hold in ll situtions similr to the ones bove. For instnce, there is the notion of N-behviourl equivlence with which NDA s, being N-colgebrs, come equipped. It coincides with the well-known notion of Prk-Milner bisimilrity from process lgebr. A generl observtion is tht if two sttes in n NDA re N-equivlent then they re lso D- (tht is, lnguge-) equivlent. For PA s, similr sttement holds. One further contribution of this pper is proof of these sttements, once nd for ll for ll F T-colgebrs under considertion. Colgebrs of type FT were studied in [29, 4, 22]. In [4, 22] the min concern ws definitions by coinduction, wheres in [29] proof principle ws lso presented. All in ll, thepresentppercn beseen s theunderstndingof theforementioned ppersfromnew perspective, presenting uniform view on vrious utomt constructions nd equivlences. The structure of the pper is s follows. After preliminries (Section 1) nd the detils of the motivting exmples bove (Section 2), Section 3 presents the generl construction s well s mny more exmples, including the colgebric chrcteristion of pushdown utomt (Section 3.2). In Section 4, lrge fmily of utomt (techniclly: functors) is chrcterised to which the constructions bove cn be pplied. Section 5 contins the ppliction of the frmework in order to recover severl interesting equivlences stemming from the world of concurrency, such s filure nd redy semntics. Section 6 discusses relted work nd presents pointers to future work. This pper is n extended version of [43]. Compred to the conference version, we include the proofs nd more exmples. More interestingly, the chrcteristion of pushdown utomt colgebriclly (Section 3.2) nd the mteril in Section 5 re originl. 1. Bckground In this section we introduce the preliminries on colgebrs nd lgebrs. First, we fix some nottion on sets. We will denote sets by cpitl letters,y,... nd functions by lower cse letters f,g,... Given sets nd Y, Y is the crtesin product of nd Y (with the usul projection mps π 1 nd π 2 ), +Y is the disjoint union (with injection mps κ 1 nd κ 2 ) nd Y is the set of functions f: Y. The collection of finite subsets of is denoted by P ω (), while the collection of full-probbility distributions with finite support is D ω () = f: [0,1] f finite support nd x f(x) = 1}. For set of letters A, A denotes the set of ll words over A; ǫ the empty word; nd w 1 w 2 (nd w 1 w 2 ) the conctention of words w 1,w 2 A Colgebrs. A colgebr is pir (,f: F()), where is set of sttes nd F: Set Set is functor. The functor F, together with the function f, determines the trnsition structure (or dynmics) of the F-colgebr [37]. An F-homomorphism from n F-colgebr (,f) to n F-colgebr (Y,g) is function h: Y preserving the trnsition structure, i.e., g h = F(h) f.

4 4 A. SILVA, F. BONCHI, M. BONSANGUE, AND J. RUTTEN An F-colgebr (Ω,ω) is sid to be finl if for ny F-colgebr (,f) there exists unique F-homomorphism [ ] : Ω. All the functors considered in exmples in this pper hve finl colgebr. Let (,f) nd (Y,g) be two F-colgebrs. We sy tht the sttes x nd y Y re behviourlly equivlent, written x F y, if nd only if they re mpped into the sme element in the finl colgebr, tht is [x] = [y] Y. For wek pullbck preserving functors, behviourl equivlence coincides with the usul notion of bisimilrity [37] Algebrs. Monds cn be thought of s generliztion of lgebric theories. A mond T = (T,µ,η) is triple consisting of n endofunctor T on Set nd two nturl trnsformtions: unit η: Id T nd multipliction µ: T 2 T. They stisfy the following commuttive lws µ η T = id T = µ Tη nd µ µ T = µ Tµ. Sometimes it is more convenient to represent mond T, equivlently, s Kleisli triple (T,( ),η) [31], where T ssigns set T() to ech set, the unit η ssigns function η : T()toechset, ndtheextensionopertion( ) ssignstoechf: T(Y) function f : T() T(Y), such tht, f η = f (η ) = id T() (g f) = g f, for g: Y T(Z). Monds re frequently referred to s computtionl types [32]. We list now few exmples. In wht follows, f: T(Y) nd c T(). Nondeterminism. T() = P ω (); η is the singleton mp x x}; f (c) = x c f(x). Prtility. T() = 1+ where 1 = } represents terminting (or diverging) computtion; η is the injection mp κ 2 : 1+; f (κ 1 ( )) = κ 1 ( ) nd f (κ 2 (x)) = f(x). Further exmples of monds include: exceptions (T() = E +), side-effects (T() = (S ) S ), interctive output (T() = µv. + (O v) = O ) nd full-probbility (T() = D ω ()). We will use ll these monds in our exmples nd we will define η nd f for ech lter in Section 3.1. A T-lgebr of mond T is pir (,h) consisting of set, clled crrier, nd function h: T() such tht h µ = h Th nd h η = id. A T-homomorphism between two T-lgebrs (,h) nd (Y,k) is function f: Y such tht f h = k Tf. T-lgebrs nd their homomorphisms form the so-clled Eilenberg-Moore ctegory Set T. There is forgetful functor U T : Set T Set defined by U T ((,h)) = nd U T (f: (,h) (Y,k)) = f: Y. The forgetful functor U T hs left djoint (T(),µ : TT() T()), mpping set to its free T-lgebr. If f: Y with (Y,h) T-lgebr, the unique T-homomorphism f : (T(),µ ) (Y,h) with f η = f is given by f : T() Tf T(Y) h Y. The function f : (T(),µ ) (T(Y),µ Y ) coincides with function extension for Kleisli triple. For the mond P ω the ssocited Eilenberg-Moore ctegory is the ctegory of join semi-lttices, wheres for the mond 1+ is the ctegory of pointed sets.

5 GENERALIZING DETERMINIZATION FROM AUTOMATA TO COALGEBRAS 5 2. Motivting exmples In this section, we introduce two motivting exmples. We will present two constructions, the determiniztion of non-deterministic utomton nd the totliztion of prtil utomton, which we will lter show to be n instnce of the sme, more generl, construction Non-deterministic utomt. A deterministic utomton (DA) over the input lphbet A is pir (, o,t ), where is set of sttes nd o,t : 2 A is function with two components: o, the output function, determines if stte x is finl (o(x) = 1) or not (o(x) = 0); nd t, the trnsition function, returns for ech input letter the next stte. DA s re colgebrs for the functor 2 Id A. The finl colgebr of this functor is (2 A, ǫ,( ) ) where 2 A is the set of lnguges over A nd ǫ,( ), given lnguge L, determines whether or not the empty word is in the lnguge (ǫ(l) = 1 or ǫ(l) = 0, resp.) nd, for ech input letter, returns the derivtive of L: L = w A w L}. From ny DA, there is unique mp l into 2 A which ssigns to ech stte its behviour (tht is, the lnguge tht the stte recognizes). l 2 A o,t ǫ,( ) 2 A 2 (2 A ) A id l A A non-deterministic utomton (NDA) is similr to DA but the trnsition function gives set of next-sttes for ech inputletter insted of singlestte. Thus, nnda over theinput lphbet A is pir (, o,δ ), where is set of sttes nd o,δ : 2 (P ω ()) A is pir of functions with o s before nd where δ determines for ech input letter set of possible next sttes. In order to compute the lnguge recognized by stte x of n NDA A, it is usul to first determinize it, constructing DA det(a) where the stte spce is P ω (), nd then compute the lnguge recognized by the stte x} of det(a). Next, we describe in colgebric terms how to construct the utomton det(a). Given n NDA A = (, o,δ ), we construct det(a) = (P ω (), o,t ), where, for ll Y P ω (), A, the functions o: P ω () 2 nd t: P ω () P ω () A re 1 y Y o(y) = 1 o(y) = t(y)() = δ(y)(). 0 otherwise (Observe tht these definitions exploit the join-semilttice structures of 2 nd P ω () A ). The utomton det(a) is such tht the lnguge l(x}) recognized by x} is the sme s the one recognized by x in the originl NDA A (more generlly, the lnguge recognized by stte of det(a) is the union of the lnguges recognized by ech stte x of A). y Y

6 6 A. SILVA, F. BONCHI, M. BONSANGUE, AND J. RUTTEN We summrize the sitution bove with the following commuting digrm: } o,δ P ω () 2 A o,t 2 2 (2 A ) A 2 P ω () id l A l ǫ,( ) We note tht the lnguge semntics of NDA s, presented in the bove digrm, cn lso be obtined s n instnce of the bstrct definition scheme of λ-coinduction [4, 22] Prtil utomt. A prtil utomton (PA) over the input lphbet A is pir (, o, ) consisting of set of sttes nd pir of functions o, : 2 (1+) A. Hereo: 2is thesmes withda. Thesecondfunction : (1+) A is trnsition function tht sends ny stte x to function (x): A 1+, which for ny input letter A is either undefined (no -lbelled trnsition tkes plce) or specifies the next stte tht is reched. PA s re colgebrs for the functor 2 (1+Id) A. Given PA A, we cn construct totl (deterministic) utomton tot(a) by dding n extr sink stte to the stte spce: every undefined -trnsition from stte x is then replced by -lbelled trnsition from x to the sink stte. More precisely, given PA A = (, o, ), we construct tot(a) = (1+, o,t ), where o(κ 1 ( )) = 0 o(κ 2 (x)) = o(x) t(κ 1 ( ))() = κ 1 ( ) t(κ 2 (x))() = (x)() (Observe tht these definitions exploit the pointed-set structures of 2 nd 1 + ). The lnguge l(x) recognized by stte x will be precisely the lnguge recognized by x in the originl prtil utomton. Moreover, the new sink stte recognizes the empty lnguge. Agin we summrize the sitution bove with the help of following commuting digrm, which illustrtes the similrities between both constructions: κ l 2 A o, o,t 1 2 (1+) A 2 (2 A ) A id l A ǫ,( ) 3. Algebriclly structured colgebrs In this section we present generl frmework where both motivting exmples cn be embedded nd uniformly studied. We will consider colgebrs for which the functor type F T cn be decomposed into trnsition type F specifying the relevnt dynmics of system nd mond T providing the stte spce with n lgebric structure. For simplicity, we fix our bse ctegory to be Set. We study colgebrs f: FT() for functor F nd mond T such tht FT() is T-lgebr, tht is FT() is the crrier of T-lgebr (FT(),h). In the motivting

7 GENERALIZING DETERMINIZATION FROM AUTOMATA TO COALGEBRAS 7 exmples, F would be instntited to 2 Id A (in both) nd T to P ω, for NDAs, nd to 1 + for PAs. The condition tht FT() is T-lgebr would mount to require tht 2 P ω () A is join-semilttice, for NDAs, nd tht 2 (1 + ) A is pointed set, for PAs. This is indeed the cse, since the set 2 cn be regrded both s join-semilttice (2 = P ω (1)) or s pointed set (2 = 1 + 1) nd, moreover, products nd exponentils preserve the lgebr structure. The inter-ply between the trnsition type F nd the computtionl type T (more precisely, the fct tht FT() is T-lgebr) llows ech colgebr f: FT() to be extended uniquely to T-lgebr morphism f : (T(),µ ) (FT(),h) which mkes the following digrm commute. η T() f f 7 FT() f η = f Intuitively, η : T() is the inclusion of the stte spce of the colgebr f: FT() into the structured stte spce T(), nd f : T() FT() is the extension of the colgebr f to T(). Next, we study the behviour of given stte or, more generlly, we would like to sy when two sttes x 1 nd x 2 re equivlent. The obvious choice for n equivlence would be F T-behviourl equivlence. However, this equivlence is not exctly wht we re looking for. In the motivting exmple of non-deterministic utomt we wnted two sttes to be equivlent if they recognize the sme lnguge. If we would tke the equivlence rising from the functor 2 P ω (Id) A we would be distinguishing sttes tht recognize the sme lnguge but hve difference brnching types, s in the following exmple. b c b We now define new equivlence, which bsorbs the effect of the mond T. We sy tht two elements x 1 nd x 2 in re F-equivlent with respect to mond T, written x 1 T F x 2, if nd only if η (x 1 ) F η (x 2 ). The equivlence F is just F- behviourl equivlence for the F-colgebr f : T() FT(). If the functor F hs finl colgebr (Ω,ω), we cn cpture the semntic equivlence bove in the following commuting digrm c η [[ ]] T() Ω f ω f FT() F(Ω) F[[ ]] (3.1)

8 8 A. SILVA, F. BONCHI, M. BONSANGUE, AND J. RUTTEN Returning to our first exmple, two sttes x 1 nd x 2 of n NDA (in which T is instntited to P ω nd F to 2 Id A ) would stisfy x 1 T F x 2 if nd only if they recognize the sme lnguge (recll tht the finl colgebr of the functor 2 Id A is 2 A ). It is lso interesting to remrk the difference between the two equivlences in the cse of prtil utomt. The colgebric semntics of PAs [39] is given in terms of pirs of prefix-closed lnguges V,W where V contins the words tht re ccepted (tht is, re the lbel of pth leding to finl stte) nd W contins ll words tht lbel ny pth (tht is ll tht re in V plus the words lbeling pths leding to non-finl sttes). We describe V nd W in the following two exmples, for the sttes s 0 nd q 0 : W = c +c b+c b V = c b c s 0 s 1 q 0 b s 2 b c q 1 b W = c +c b V = c b Thus, the sttes s 0 nd q 0 would be distinguished by FT-equivlence (for F = 2 Id A nd T = 1+ ) but they re equivlent with respect to the mond 1+, s 0 T F q 0, since they ccept the sme lnguge. We will show in Section 4 tht the equivlence FT is lwys contined in T F Exmples. In this section we show more exmples of pplictions of the frmework bove Prtil Mely mchines. A prtil Mely mchine is set of sttes together with function t: (B (1 + )) A, where A is set of inputs nd B is set of output vlues. We ssume tht B hs distinguished element B. For ech stte x nd for ech input the utomton produces n output vlue nd either termintes or continues to next stte. Applying the frmework bove we will be totlizing the utomton, similrly to wht hppened in the exmple of prtil utomt, by dding n extr stte to the stte spce which will ct s sink stte. The behviour of the totlized utomton is given by the set of cusl functions from A ω (infinite sequences of A) to B ω, which we denote by Γ(A ω,b ω ) [38]. A function f: A ω B ω is cusl if, for σ A ω, the n-th vlue of the output strem f(σ) dependsonly on the first n vlues of the inputstrem σ. In the digrm below, we define the finl mp [ ]: 1+ Γ(A ω,b ω ): κ Γ(A ω,b ω ) [κ 1 ( )](σ) = (,,...) t [κ t 2 (x)](:τ) = b:([z](τ)) where t(x)() = b,z 4 (B (1+)) A (B Γ(A ω,b ω )) A Here 1, x, A, b B, σ A ω, z 1+, nd :τ denotes the prefixing of the strem τ A ω with the element. [[ ]]

9 GENERALIZING DETERMINIZATION FROM AUTOMATA TO COALGEBRAS Structured Moore utomt. In the following exmples we look t the functor F() = T(B) A for rbitrry sets A nd B nd n rbitrry mond T = (T,η,( ) ). The colgebrs of F represents Moore utomt with outputs in T(B) nd inputs in A. Since T(B) is T-lgebr, T() A is T-lgebr nd the product of T-lgebrs is still T-lgebr, then FT() is T-lgebr. For this reson, the (pir of) functions o: T(B) nd t: T() A lift to (pir of) functions o : T() T(B) t : T() T() A The finl colgebr of F is T(B) A. We cn chrcterize the finl mp [ ]: T() T(B) A, for ll m T(), A nd w A, by η T() T(B) A o,t [m](ǫ) = o (m) o,t [m]( w) = [t ǫ,( ) (m)()](w) 1 T(B) T() A T(B) (T(B) A ) A Below we shll look t vrious concrete instnces of this scheme, for different choices of the mond T. Moore utomt with exceptions. Let E be n rbitrry set, the elements of which we think of s exceptions. We consider the exception mond T() = E + which hs the function η(x) = κ 2 (x) s its unit. We define the lifting f : T() T(Y), for ny function f: T(Y), by f = [id,f]. An FT-colgebr o,t : (E +B) (E +) A will ssocite with every stte x n output vlue (either in B or n exception in E) nd, for ech input, next stte or n exception. The behviour of stte x, given by [η(x)], will be forml power series over A with output vlues in E + B; tht is, function from A to E + B. The finl mp is defined s follows, for ll e E, x, A, nd w A : κ 2 E + (E +B) A o,t [κ 1 (e)](w) = κ 1 (e) o,t [κ 2 (x)](ǫ) = o(x) [κ 2 (x)]( w) = [t(x)()](w) (E +B) (E +) A (E +B) ((E +B) A ) A [[ ]] [[ ]] Moore utomt with side effects. Let S be n rbitrry set of so-clled side-effects. We consider the mond T() = (S ) S, with unit η defined, for ll x nd s S, by η(x)(s) = s,x. We define the lifting f : T() T(Y) of function f: T(Y) by f (g)(s) = f(x)(s ), for ny g T() nd s S, nd with g(s) = s,x. Consider n FT-colgebr o,t : (B S) S ((S ) S ) A nd let us explin the intuition behind this type of utomton type. The set S cn be interpreted s the configurtions of the utomton, where S contins informtion bout the stte of the system nd bout the control of the system. Using the isomorphism (S B) S =

10 10 A. SILVA, F. BONCHI, M. BONSANGUE, AND J. RUTTEN S S B, we cn think of o: (S B) S s function tht for ech configurtion in S provides n output in B nd the new stte of the system in S. The trnsition function t: ((S ) S ) A gives new configurtion for ech input letter nd current configurtion, using gin the fct tht ((S ) S ) A = S (S ) A. In ll of this, concrete instnce of the set of side-effects could be, for exmple, the set S = V L of functions ssociting memory loctions to vlues. The behviour of stte x will be given by [η(x)], where the finl mpping is s follows. For ll g (S ) S, s S, A nd w A, nd with g(s) = s,x, we hve η (S ) S ((B S) S ) A o,t [g](ǫ)(s) = o(x)(s ) o,t [g]( w) = [λs.t(x)()(s )](w) (B S) S ((S ) S ) A (B S) S (((B S) S ) A ) A Moore utomt with interctive output. Let O be n rbitrry set of outputs. Consider the interctive output mond defined by the functor T() = µv.+(o v) = O together with the nturl trnsformtion η = λx. ǫ,x, nd for which the lifting f : T() T(Y) of function f: T(Y) is given by f ( w,x ) = ww,y with f(x) = w,y. We consider F T-colgebrs [[ ]] o,t : (O B) (O ) A ForB = 1, thebovecolgebrscoincidewith(totl) subsequentil trnsducers [17]: o: O is the finl output function; t: (O ) A is the piring of the output function nd the next stte-function. The behviour of stte x will be given by [η(x)] = [ ǫ,x ], where, for every w,x O, [ w,x ]: A O, is given by [ w,x ](ǫ) = w o(x) [ w,x ](w 1 ) = w ([t(x)()](w 1 )) Probbilistic Moore utomt. Consider the mond of probbility distributions defined, for ny set, by T() = D ω () Its unit is given by the Dirc distribution, defined for x,x by η(x)(x 1 x = x ) = 0 otherwise The lifting f : T() T(Y) of function f: T(Y) is given, for ny distribution c D ω () nd ny y Y, by f (c)(y) = c(x) d(y) We will consider F T-colgebrs d D ω(y) x f 1 (d) o,t : D ω (B) D ω () A

11 GENERALIZING DETERMINIZATION FROM AUTOMATA TO COALGEBRAS 11 More specificlly, we tke B = 2 which implies D ω (2) = [0,1]. For this choice of B, the bove F T-colgebrs re precisely the (Rbin) probbilistic utomt [36]. Ech stte x hs n output vlue in o(x) [0,1] nd, for ech input, t(x)() is probbility distribution of next sttes. The behviour of stte x is given by [η(x)]: A [0,1], defined below. Intuitively, one cn think of [η(x)] s probbilistic lnguge: ech word is ssocited with vlue p [0,1]. The finl mpping η D ω () [0,1] A o,t o,t 2 [0,1] D ω () A [0,1] ([0,1] A ) A is given, for ny d D ω (), x, A, nd w A, by [d](ǫ) = ( d(x)) b b [0,1] o(x)=b [d](w) = [λx. ( b=t(x)() d(x)) c(x )](w) c D ω() It is worth noting tht this exctly cptures the semntics of [36], while the ordinry FT coincides with probbilistic bisimilrity of [28]. Moreover T F coincides with the trce semntics of probbilistic trnsition systems defined in [19] (see Section 7.2 of [23]) Pushdown utomt, colgebriclly. Recursive functions in computer progrm led nturlly to stck of recursive function clls during the execution of the progrm. In this section, we provide colgebric model of utomt equipped with stck memory. A pushdown mchine is tuple (Q,A,B,δ), where Q is set of control loctions (sttes), A is set of inputsymbols, B is set of stck symbols, nd δ is finite subsetof Q A B Q B, clled the set of trnsition rules. Note tht we do not insist on the sets Q, A nd B to be finite nd consider only reltime pushdown mchines, i.e. without internl trnsitions (lso clled ǫ-trnsitions) [21]. A configurtion k of pushdown mchine is pir q, β denoting the current control stte q Q nd the current content of the stck β B. In denoting the stck s string of stck symbols we ssume tht the topmost symbol is written first. There is trnsition q,bβ q,αβ if q,α δ(q,,b). A convenient nottion is to introduce for ny string w A the trnsition reltion on configurtions s the lest reltion such tht (1) k ǫ k (2) k w k if nd only if k k nd k w k. A pushdown utomton (pd) is pushdown mchine together with n initil configurtion k 0 nd set K of ccepting configurtions. The sets of ccepting configurtions usully considered re (1) the set F B, where F Q is clled the set of ccepting sttes, or (2) Q ǫ}, but lso (3) F ǫ} for F Q, or (4) Q B B for B subset of B. A word w A w is sid to be ccepted by pd (Q,A,B,δ,k 0,K) if k 0 k for some k K. A pd with ccepting configurtions s in (1) is sid to be with ccepting sttes, wheres, when they re s in (2) then the pd is sid to be ccepting by empty stck. They both [[ ]]

12 12 A. SILVA, F. BONCHI, M. BONSANGUE, AND J. RUTTEN ccept exctly proper context free lnguges (i.e. context free lnguges without the empty word) [3]. Computtions in pushdown mchine re generlly non-deterministic nd cn cuse chnge in the control stte of the utomton s well s in its stck. For this reson we will model the effects of the computtions by mens of the so-clled non-deterministic side-effect mond [5]. For set of sttes S, let T be the functor P ω ( S) S. It is mond when equipped with the unit η : T(), defined by η(x)(s) = x,s }, nd the multipliction µ : T(T()) T() given by µ (k)(s) = c(s ) c,s k(s) Note tht, for function f: T(Y), the extension f : T() T(Y) is defined by f (c)(s) = f(x )(s ). x,s c(s) Exmples of lgebrs for this mond re T(1) = P ω (S) S nd 2 S. The ltter cn in fct be obtined s quotient of the former by equting those functions k 1,k 2 : S P ω (S) such tht for ll s S, k 1 (s) = if nd only if k 2 (s) =. Every pushdown mchine (Q,A,B,δ) together with set of ccepting configurtions K induces function o,t : Q FTQ where F is the functor 2 B id A nd T is the mond defined bove specilized for S = B (intuitively, side effects in pushdown mchine re chnges in its stck). The functions o: Q 2 B nd t: Q P ω (Q B ) B A re defined s o(q)(β) = 1 if nd only if q,β K t(q)()(ǫ) = t(q)()(bβ) = q,αβ q,α δ(q,,b)} The trnsition function t describes the steps between pd configurtions nd it is specified in terms of the trnsition instructions δ of the originl mchine. From the bove is cler tht not every function o,t : Q FTQ defines pushdown mchine with ccepting configurtions, s, for exmple, t(q) my depend on the whole stck β nd not just on the top element b. Therefore we restrict our ttention to consider functions o,t : Q FTQ such tht (1) t(q)()(ǫ) = (2) t(q)()(bβ) = q,αβ q,α t(q)()(b)}, Every o,t stisfying (1) nd (2) bove defines the pushdown mchine (Q,A,B,δ) with δ(q,,b) = t(q)()(b) nd with ccepting configurtion K = q,β o(q)(β) = 1}. The first condition is sserting tht mchine is in dedlock configurtion when the stck is empty, while the lst condition ensures tht trnsition steps depend only on the control stte nd the top element of the stck. For this reson we will write q,b α q for q,αβ t(q)()(b) indicting tht the pushdown mchine in the stte q by reding n input symbol nd popping b off the stck, cn move to control stte q pushing the string α B on the current stck (here denoted by β). Similrly to wht we hve shown in the exmples of structured Moore utomt, for every function o,t : Q FTQ there is unique F-colgebr mp [ ]: T(Q) 2 B A, which is lso T-lgebr homomorphism. It is defined for ll c P ω (Q B ) B nd β B

13 GENERALIZING DETERMINIZATION FROM AUTOMATA TO COALGEBRAS 13 s η Q P ω (Q B ) B 2 B A o,t o,t 2 B P ω (Q B ) B A 2 B 2 B A A [[ ]] [η(q)](ǫ) = o(q) [η(q)](w) = [λβ.t(q)()(β)](w) [c](β) = [η(q)](α). q,α c(β) We then hve tht word w A is ccepted by the pd (Q,A,B,δ,k 0,K) with k 0 = q,β if nd only if [η(q)](w)(β) = 1. The bove definition implies tht for given word w A we cn decide if it is ccepted by o,t : Q FTQ from n initil configurtion k 0 = q,β in exctly w steps (ssuming there is procedure to decide whether o(q)(β) = 1). As consequence, we cnnot use structured Moore utomt to model Turing mchines, for which the hlting problem is undecidble: in generl terms, for Turing mchines, we would need internl trnsitions tht do not consume input symbols. We conclude with n exmple of our construction using pushdown mchine with control sttes Q = q 0,q 1 }, over n input lphbet A =,b} nd using stck symbols B = x,s}. The trnsitions rules δ re given below:,s x q 0 b,x ǫ,x xx We tke K = q 0,ǫ, q 1,ǫ }, mening tht o(q 0 )(ǫ) = 1, o(q 1 )(ǫ) = 1 nd o(q i )(β) = 0 in ll other cses. By considering k 0 = q 0,s s initil configurtion, we then hve q 1 b,x ǫ [η(q 0 )](ǫ)(s) = o(q 0 )(s) = 0 mening tht the empty word is not ccepted by the pd (Q,A,B,δ,k 0,K). However, the word b is ccepted: [η(q 0 )](b)(s) = [λβ.t(q 0 )()(β)](b)(s) = [η(p)](b)(β) p,β t(q 0 )()(s) = [η(q 1 )](b)(x) = [λβ.t(q 1 )(b)(β)](ǫ)(x) = [η(p)](ǫ)(β) p,β t(q 1 )(b)(x) = [η(q 1 )](ǫ)(ǫ) = o(q 1 )(ǫ) = 1. In fct, the lnguge ccepted by the bove pushdown utomton is n b n n 1}. The structured sttes c i TQ, their trnsitions nd their outputs of (prt of) the ssocited Moore utomton re given in Figure 1. Context-free grmmrs generting proper lnguges (i.e. not contining the empty word ǫ) re equivlent to reltime pd s [11, 13, 42]. Given n input lphbet A, nd set

14 14 A. SILVA, F. BONCHI, M. BONSANGUE, AND J. RUTTEN,s x q 0 b,x ǫ q 1,x xx b,x ǫ c b c 2 c 5 5 c 0 c 1 c 6 b b b c 3 c 7 b b,b b q 0,xβ } if β = sβ c 2 = λβ. q 0,xxβ } if β = xβ q 0,xxβ } if β = sβ c 4 = λβ. q 0,xxxβ } if β = xβ c 6 = λβ. 1 if β = ǫ o (c 0 ) = o (c 1 ) = λβ. 0 otherwise o (c 2 ) = o (c 4 ) = o (c 6 ) = λβ.0 1 if β = x o (c 3 ) = o (c 5 ) = λβ. 0 otherwise 1 if β = xxs o (c 7 ) = λβ. 0 otherwise c 0 = η(q 0 ) c 1 = η(q 1 ) q1,β c 3 = λβ. } if β = xβ q 1,β } if β = sβ c 5 = λβ. q 1,xβ } if β = xβ q1,β c 7 = λβ. } if β = xxβ Figure 1: The structured sttes c i TQ, their trnsitions nd their output of (prt of) the Moore utomton ssocited to the pd (Q,A,B,δ,k 0,K) where Q = q 0,q 1 }, A =,b}, B = x,s}, δ is depicted on the left top, k 0 = q 0,s nd K = q 0,ǫ, q 1,ǫ }. of vribles B, let G = (A,B,s,P) becontext-free grmmr in Greibch norml form [15], i.e. with productions in P of the form b α with b B, A nd α B. We cn construct function o,t : 1 FT1 (where 1 = }) by setting o( )(β) = 1 if nd only if β = ǫ nd t( )()(bβ) =,αβ b α P}. Clerly this function stisfies conditions (1) nd (2) bove, nd thus, together with the initil configurtion,s defines pd. Furthermore, [η( )](w)(s) = 1 if nd only if there exists derivtion for w A in the grmmr G. As n exmple, let us consider the grmmr (,b},s,x},s,p) with productions P = s sx,s x,x b}genertingthelnguge n b n n 1}. Thessocited colgebr o,t : 1 FT1 is given by,s sx *,s x with o( )(β) = 1 iff β = ǫ b,x ǫ

15 GENERALIZING DETERMINIZATION FROM AUTOMATA TO COALGEBRAS 15,s sx,s x * c 3 b,x ǫ b c 4 c 0 = η( ),sxβ c 1 = λβ.,,xβ } if β = sβ c 0 b c 1 c 5 c 2 c 6 b c 7,β c 2 = λβ. } if β = xβ,sxxβ c 3 = λβ.,,xβ } if β = sβ,β c 4 = λβ. } if β = sβ,sxβ c 5 = λβ.,,xβ } if β = ssβ o (c 0 ) = λβ. 1 if β = ǫ 0 otherwise o (c 2 ) = λβ. 1 if β = x 0 otherwise,sxβ c 6 = λβ.,,xβ } if β = xsβ,β c 7 = λβ. } if β = xxβ o (c 1 ) = o (c 3 ) = o (c 5 ) = o (c 6 ) = λβ.0 o (c 7 ) = λβ. 1 if β = xx 0 otherwise o (c 4 ) = λβ. 1 if β = s 0 otherwise Figure 2: The structured sttes c i TQ, their trnsitions nd their output of (prt of) the Moore utomton ssocited to the pd (Q,A,B,δ,k 0,K) where Q = }, A =,b}, B = x,s}, δ is depicted on the left top, k 0 =,s nd K =,ǫ }. Even if the lnguge ccepted by the bove pd is the sme s the one ccepted by the pd in the previous exmple (i.e., [η( )](w)(s) = [η(q 0 )](w)(s) for ll w A ), the two ssocited Moore utomton re not in T F (tht is [η( )] [η(q 0 )]). In fct, the Moore utomton ssocited to the bove colgebr (see below) ccepts the string bb when strting from the configurtion,ss, while the one in the previous exmple does not (in symbols, [η( )](bb)(ss) = 1 while [η(q 0 )](bb)(ss) = 0). The bove chrcteriztion of context free lnguges over n lphbet A is different nd complementry to the colgebric ccount of context-free lnguges presented in [44]. The ltter, in fct, uses the functor D() = 2 A for deterministic utomt (insted of the Moore utomt with output in 2 B bove, for B set of vribles), nd the idempotent semiring mond T() = P ω ((+A) ) (insted of our side effect mond) to study different

16 16 A. SILVA, F. BONCHI, M. BONSANGUE, AND J. RUTTEN but equivlent wys to present context-free lnguges: using grmmrs, behviourl differentil equtions nd generlized regulr expressions in which the Kleene str is replced by unique fixed point opertor. 4. Colgebrs nd T-Algebrs In the previous section we presented frmework, prmeterized by functor F nd mond T, in which systems of type FT (tht is, FT-colgebrs) cn be studied using novel equivlence T F insted of the clssicl FT. The only requirement we imposed ws tht FT() hs to be T-lgebr. In this section, we will present functors F for which the requirement of FT() being T-lgebr is gurnteed becuse they cn be lifted to functor F on T-lgebr. For these functors, the equivlence T F coincides with F. In other words, working on FTcolgebrs in Set under the novel T F equivlence is the sme s working on F -colgebrs on T-lgebrs under the ordinry F equivlence. Next, we will prove tht for this clss of functors nd n rbitrry mond T the equivlence FT is contined in T F. Instntiting this result for our first motivting exmple of non-deterministic utomt will yield the well known fct tht bisimilrity implies trce equivlence. Let T be mond. An endofunctor F : Set T Set T is sid to be the T-lgebr lifting of functor F: Set Set if the following squre commutes 1 : Set T F Set T U T Set F If the functor F hs T-lgebr lifting F then FT() is the crrier of the lgebr F (T(),µ). Functors tht hve T-lgebr lifting re given, for exmple, by those endofunctors on Set constructed inductively by the following grmmr Set U T F:: = Id B F F F A TG where A is n rbitrry set, B is the constnt functor mpping every set to the crrier of T-lgebr (B,h), nd G is n rbitrry functor. Since the forgetful functor U T : Set T Set cretes nd preserves limits, both F 1 F 2 nd F A hve T-lgebr lifting if F, F 1, nd F 2 hve. Finlly, TGhsT-lgebrliftingforeveryendofunctorGgivenbythessignment (,h) (TG,µ G ). Note tht we do not llow tking coproducts in the bove grmmr, becuse coproducts of T-lgebrs re not preserved in generl by the forgetful functor U T. Insted, one could resort to extending the grmmr with the crrier of the coproduct tken directly in Set T. For instnce, if T is the (finite) powerset mond, then we could extend the bove grmmr with the functor F 1 F 2 = F 1 +F 2 +, }. All the functors of the exmples in Sections 2 nd 3, s well s those in Section 5, cn be generted by the bove grmmr nd, therefore, they hve T-lgebr lifting. Now, let F befunctor with T-lgebr lifting nd for which finl colgebr Ω exists. If Ω cn be constructed s the limit of the finl sequence (for exmple ssuming the functor 1 This is equivlent to the existence of distributive lw λ: TF FT [24].

17 GENERALIZING DETERMINIZATION FROM AUTOMATA TO COALGEBRAS 17 ccessible [1]), then, becuse the forgetful functor U T : Set T Set preserves nd cretes limits, Ω is the crrier of T-lgebr, nd it is the finl colgebr of the lifted functor F. Further, for ny FT-colgebr f: FT(), the unique F-colgebr homomorphism [ ] s in digrm (3.1) is T-lgebr homomorphism between T() nd Ω. Conversely, the crrier of the finl F -colgebr (in Set T ) is the finl F-colgebr (in Set). Intuitively, the bove mens tht for n ccessible functor F with T-lgebr lifting F, F -equivlence in Set T coincides with F-equivlence with respect to T in Set. The ltter equivlence is corser thn the F T-equivlence in Set, s stted in the following theorem. Theorem 4.1. Let T be mond. If F is n endofunctor on Set for which finl colgebr exists nd with T-lgebr lifting, then FT implies T F. Proof. We first show tht there exists functor from the ctegory of FT-colgebrs to the ctegory of F-colgebrs. This functor mps ech FT-colgebr (,f) into the F-colgebr (T(),f ) nd ech FT-homomorphism h: (,f) (Y,g) into the F-homomorphism T(h): (T(),f ) (T(Y),g ). In order to prove tht this is functor we just hve to show tht T(h) is n F-homomorphism (i.e., the bckwrd fce of the following digrm commutes). T() η h f FT() f FT(h) T(h) T(Y) η Y Y g FT(Y) NotethtthefrontfceofthebovedigrmcommutesbecusehisnFT-homomorphism. Also the top fce commutes becuse η is nturl trnsformtion. Thus FT(h) f η = FT(h) f = g h nd lso g T(h) η = g η Y h = g h. Since η is the unit of the djunction, then there exists unique j : T() FT(Y) in Set T such tht g h = j η. Since both FT(h) f nd g T(h) re (by construction) morphisms in Set T, then FT(h) f = g T(h). Let(,f)nd(Y,g)betwoFT-colgebrsnd [ ] nd [ ] Y theirmorphismsintothe finl FT-colgebr (Ω,ω). Let (T(),f ), (T(Y),g ) nd (T(Ω),ω ) be the corresponding F-colgebrs nd [ ] T, [ ] TY nd [ ] TΩ their morphisms into the finl F-colgebr (Ω,ω ). Since T([ ] ): (T(),f ) (T(Ω),ω ) is n F-homomorphism, then by uniqueness, [ ] T = [ ] TΩ T([ ] ). g

18 18 A. SILVA, F. BONCHI, M. BONSANGUE, AND J. RUTTEN [[ ]] T T() η f FT() f [[ ]] FT([[ ]] ) T([[ ]] ) T(Ω) η Ω Ω ω FT(Ω) F([[ ]] T ) ω F([[ ]] TΩ ) [[ ]] TΩ Ω F(Ω ) ω With the sme proof, we obtin [ ] TY = [ ] TΩ T([ ] Y ). Recll tht for ll x nd y Y, by definition, x FT y iff [x] = [y] Y nd x T F y iff [η (x)] T = [η Y (y)] TY. Suppose tht [x] = [y] Y. Then, T([η (x)] ) = η Ω [x] = η Ω [y] Y = T([η Y (y)] Y ) nd, finlly, [η (x)] T = [ ] TΩ T([η (x)] ) = [ ] TΩ T([η Y (y)] Y ) = [η Y (y)] TY. Thebovetheoreminstntites tothewell-knownfcts: fornda,wheref() = 2 A nd T = P ω, tht bisimilrity implies lnguge equivlence; for prtil utomt, where F() = 2 A nd T = 1 +, tht equivlence of pirs of lnguges, consisting of defined pths nd ccepted words, implies equivlence of ccepted words; for probbilistic utomt, where F() = [0,1] A nd T = D ω, tht probbilistic bisimilrity implies probbilistic/weighted lnguge equivlence. Note tht, in generl, the bove inclusion is strict. Remrk. Let (,f) be n FT-colgebr for mond T nd functor F. If η: id T is pointwise injective, then FT on the FT-colgebr (,f) coincides with TFT on the extended TFT-colgebr (,η FT() f) [37, 4]. If moreover F hs T-lgebr lifting then, by the bove theorem (on the extended TFT-colgebr), TFT implies T TF. Combining the two implictions, it follows tht ht FT on the FT-colgebr (,f) implies T TF on theextended TFT-colgebr (,η FT() f). Finlly, underthe ssumptiontht F hs T- lgebr lifting, we lso hve tht T F the FT-colgebr (,f) implies T TF on the extended TFT-colgebr (,η FT() f). This yields the following hierrchy of equivlences. T TF T F TFT = FT

19 GENERALIZING DETERMINIZATION FROM AUTOMATA TO COALGEBRAS Beyond Bisimilrity nd Trces The opertionl semntics of interctive systems is usully specified by lbeled trnsition systems (LTS s). The denottionl semntics is given in terms of behviourl equivlences, which depend the mount of brnching structure considered. Bisimilrity (full brnching) is sometimes considered too strict, while trce equivlence (no brnching) is often considered too corse. The liner time / brnching time spectrum [14] shows txonomy of mny interesting equivlences lying in between bisimilrity nd trces. Lbeled trnsition system re colgebrs for the functor P ω (Id) A nd the colgebric equivlence Pω(Id) A coincides with the stndrd notion of Prk-Milner bisimilrity. In [35], it is shown colgebric chrcteriztion of trces semntics (for LTS s) employing Kleisli ctegories. More recently, [33] hve provided chrcteriztion of trce, filure nd redy semntics by men of behviour objects. Another colgebric pproch [26] relies on test-suite tht, intuitively, re frgments of Hennessy-Milner logic. In this section, we show tht (finite) trce equivlence [20], complete trce equivlence [14], filures [9] nd redy semntics [34] cn be seen s specil cses of T F. Before introducing these semntics, we fix some nottions. A lbeled trnsition system is pir (,δ) where is set of sttes nd δ: P ω () A is function ssigning to ech stte x nd to ech lbel A finite set of possible successors sttes: x y mens tht y δ(x)(). Given word w A, we write x w y for x 1... n y nd w = 1... n. When w = ǫ, x ǫ y iff y = x. For function ϕ P ω () A, I(ϕ) denotes the set of ll lbels enbled by ϕ, i.e., A ϕ() }, while Fil(ϕ) denotes the set Z A Z I(ϕ) = }. Let,δ be LTS nd x be stte. A trce of x is word w A such tht x w y for some y. A trce w of x is complete if x w y nd y stops, i.e., I(δ(y)) =. A filure pir of x is pir w,z A P ω (A) such tht x w y nd Z Fil(δ(y)). A redy pir of x is pir w,z A P ω (A) such tht x w y nd Z = I(δ(y)). We use T (x), CT(x), F(x) nd R(x) to denote, respectively, the set of ll trces, complete trces, filure pirs nd redy pirs of x. For I rnging over T,CT,F nd R, two sttes x nd y re I-equivlent iff I(x) = I(y). For n exmple, consider the following trnsition systems lbeled over A =, b, c}. They re ll trce equivlent becuse their trces re,b,c. The trce is lso complete for p, but not for the others. Only r nd s re filure equivlent, since,bc} is filure pir only of p, while,b} nd,c} re filure pirs of p, r nd s, but not of q. Finlly they re ll redy different, since, is redy pir only of p,,b,c} is redy pir of q nd s but not of r, nd,b} nd,c} re redy pirs only of r nd s. b p c b q c b r c b s c b We cn now show tht these equivlences re instnces of T F. We first show redy equivlence in detils nd then, briefly, the others. c

20 20 A. SILVA, F. BONCHI, M. BONSANGUE, AND J. RUTTEN Tke T = P ω nd F = P ω (P ω (A)) id A. For ech set, consider the function π R : P ω() A FT() defined for ll ϕ P ω () A by π R (ϕ) = I(ϕ)},ϕ. This function llows to trnsform ech LTS (,δ) into the FT-colgebr (,π R δ). The ltter hs the sme trnsitions of,δ, but ech stte x is decorted with the set I(ϕ)}. Now, by employing the powerset construction, we trnsform,π R δ into the F- colgebr (P ω (), o,t ), where, for ll Y P ω (), A, the functions o: P ω () P ω (P ω (A)) nd t: P ω () P ω () A re o(y) = I(δ(y))} t(y)() = δ(y)(). y Y The finl F-colgebr is (P ω (P ω (A)) A, ǫ,( ) ) where ǫ,( ) is defined s usul. } P ω () P ω (P ω (A)) A δ [Y ](ǫ) = o(y) (P ω ()) A ǫ,( ) o,t [Y ](w) = [t(y)()](w) π R 2 P ω (P ω (A)) (P ω ()) A P ω (P ω (A)) (P ω (P ω (P ω (A)) A )) A Summrizing, the finl mp [ ]: P ω () P ω (P ω (A)) A mps ech x} into function ssigning to ech word w, the set Z A x w y nd Z = I(δ(y))}. In other terms, Z [x}](w) iff w,z R(x). Forthesttesdepictedbove, [s}](ǫ) = }}, [s}]() = b},b,c},c}}, [s}](b) = [s}](c) = } nd for ll the other words w, [s}](w) =. The other semntics cn be chrcterized in the sme wy, by choosing different functors F nd different functions π : P ω () A FT. For filure semntics, tke the sme functor s for the redy semntics, tht is F = P ω (P ω (A)) id A nd new function π F : P ω() A FT() defined ϕ P ω () A by [[ ]] π F (ϕ) = Fil(ϕ),ϕ. The FT-colgebr (,π F δ) hs the sme trnsitions of the LTS,δ, but ech stte x is decorted with the set Fil(ϕ). For both trce nd complete trce equivlence, tke F = 2 id A (s for NDA). For trce equivlence, π T : P ω() A FT() mps ϕ P ω () A into 1,ϕ. Intuitively, (,π T δ) is n NDA where ll the sttes re ccepting. For complete trces, π CT : P ω() A FT() mps ϕ in 1,ϕ if I(ϕ) = (nd in 0,ϕ otherwise). By tking T = D ω insted of T = P ω, we hope to be ble to chrcterize probbilistic trce, complete trce, redy nd filure s defined in [25]. y Y

21 GENERALIZING DETERMINIZATION FROM AUTOMATA TO COALGEBRAS Discussion In this pper, we lifted the powerset construction on utomt to the more generl frmework of FT-colgebrs. Our results led to uniform tretment of severl kinds of existing nd new vritions of utomt (tht is, F T-colgebrs) by n lgebric structuring of their stte spce through mond T. We showed s exmples prtil Mely mchines, structured Moore utomt, nondeterministic, prtil nd probbilistic utomt. Furthermore, we hve presented n interesting colgebric chrcteriztion of pushdown utomt nd showed how severl behviourl equivlences stemming from concurrency theory cn be retrieved from the generl frmework. It is worth mentioning tht the frmework instntites to mny other exmples, mong which re weighted utomt [41]. These re simply structured Moore utomt for B = 1 nd T = S ω (for semiring S) [16]. It is esy to see tht FT coincides with weighted bisimilrity [10], while T F coincides with weighted lnguge equivlence [41]. Some of the forementioned exmples cn lso be colgebriclly chrcterized in the frmework of [19, 18]. There, insted of considering FT-colgebrs on Set nd F - colgebrsonset T (theeilenberg-moorectegory), TG-colgebrs onsetndg-colgebrs on Set T (the Kleisli ctegory) re studied. The min theorem of [19] sttes tht under certin ssumptions, the initil G-lgebr is the finl G-colgebr tht chrcterizes (generlized) trce equivlence. The exct reltionship between these two pproches hs been studied in [23] (nd, indirectly, it could be deduced from [6] nd [27]). It is worth to remrk tht mny of our exmples do not fit the frmework in [19]: for instnce, the exception, the side effect, the full-probbility nd the interctive output monds do not fulfill their requirements (the first three do not hve bottom element nd the ltter is not commuttive). Moreover, we lso note tht the exmple of prtil Mely mchines is not purely trce-like, s ll the exmples in [19]. The ide of using monds for modeling utomt with non-determinism, probbilism or side-effects dtes bck to the λ-mchines of [2] tht, rther thn colgebrs, rely on lgebrs. More precisely, thedynmicof λ-mchine is morphismδ: F T, wheref is functor nd T is mond (for instnce the trnsitions of T-structured Moore utomt re function δ: A T mpping stte nd n input symbol into n element of T ). Anlogously to our pproch, ech λ-mchine induces n implicit λ-mchine hving T s stte spce. Mny exmples of this pper (like Moore utomt) cn be seen s λ-mchines, but those systems tht re essentilly colgebric (like Mely mchines) do not fit the frmework in [2]. There re severl directions for future reserch. On the one hnd, we will try to exploit F-bisimultions up to T [29, 30] s sound nd complete proof technique for T F. On the other hnd, we would like to lift mny of those colgebric tools tht hve been developed for brnching equivlences (such s colgebric modl logic [12, 40] nd (xiomtiztion for) regulr expressions [8]) to work with the liner equivlences induced by T F. We hve pursued further the pplictions to decorted trces nd the chllenging modeling of the full liner-time spectrum in seprte pper [7], work which we lso pln to extend to probbilistic trces.

22 22 A. SILVA, F. BONCHI, M. BONSANGUE, AND J. RUTTEN References [1] J. Adámek. Free lgebrs nd utomt reliztion in the lnguge of ctegories. Comment. Mth. Univ. Croline, 15: , [2] M. Arbib, nd E. Mnes. Fuzzy mchines in ctegory. Bull. Austrl. Mth. Soc., 13: , [3] J.-M. Autebert, J. Berstel, nd L. Bosson. Context-Free Lnguges nd Push-Down Automt. In G. Rozenberg nd A. Slom (eds.), Hndbook of Forml Lnguges, Volume 1, pges Springer- Verlg, [4] F. Brtels. On generlized coinduction nd probbilistic specifiction formts. PhD thesis, Vrije Universiteit Amsterdm, [5] N. Benton, J. Hughes, nd E. Moggi. Monds nd Effects. Course notes for APPSEM Summer School, Avilble on line t [6] A. Bln, nd A. Kurz. On Colgebrs over Algebrs. Electronic Notes in Theoreticl Computer Science. 264(2): (2010) [7] F. Bonchi, M.M. Bonsngue, G. Cltis, J.J.M.M. Rutten, nd A. Silv. Finl semntics for decorted trces, In Proceedings of MFPS, ENTCS, Elsevier, 2012, to pper. [8] M.M. Bonsngue, J.J.M.M. Rutten, nd A. Silv. An lgebr for Kripke polynomil colgebrs. In Proceedings of 24th Annul IEEE Symposium on Logic In Computer Science (LICS 2009), pges IEEE Computer Society, [9] S.D. Brookes, C.A.R. Hore nd A.W. Roscoe. A Theory of Communicting Sequentil Processes. Journl of the ACM, 31(3): , ACM [10] P. Buchholz. Bisimultion reltions for weighted utomt. Theoreticl Computer Science, 393(1-3): , Elsevier, [11] N. Chomsky. Context Free Grmmrs nd Pushdown Storge. Qurterly Progress Report, volume 65, MIT Reserch Lbortory in Electronics, Cmbridge, MA, [12] C. Cîrste, A. Kurz, D. Pttinson, L. Schröder, nd Y. Venem. Modl logics re colgebric. Computer Journl 54(1):31 41, Oxford University Press, [13] R.J. Evey. Appliction of Pushdown Store Mchines. In Proceedings of the 1963 Fll Joint Computer Conference (AFIPS 1963), ACM, [14] R.J. vn Glbbeek. The Liner Time-Brnching Time Spectrum. In E. Best (Ed.), Proceedings of CON- CUR 93, volume 458 of Lecture Notes in Computer Science, pges Springer, [15] S. Greibch. A Note on Pushdown Store Automt nd Regulr Systems. Proceedings of the Americn Mthemticl Society, 18: , Americn Mthemticl Society [16] H.P. Gumm nd T. Schröder. Monoid-lbeled trnsition systems. Electronic Notes in Theoreticl Computer Science, 44(1): , Elsevier [17] H.H. Hnsen. Colgebrising subsequentil trnsducers. Electronic Notes in Theoreticl Computer Science, 203(5): , [18] I. Hsuo. Trcing Anonymity with Colgebrs. PhD thesis, Rdboud University Nijmegen, [19] I. Hsuo, B. Jcobs, nd A. Sokolov. Generic trce semntics vi coinduction. Logicl Methods in Computer Science, 3(4):1 36, [20] C. A. R. Hore. Communicting Sequentil Processes. Communinction of the ACM., 21(8): , ACM, [21] J. Hopcroft, J. Ullmn. Introduction to Automt Theory, Lnguges, nd Computtion. Addison- Wesley, [22] B. Jcobs. Distributive lws for the coinductive solution of recursive equtions. Informtion nd Computtion, 204(4): , [23] B. Jcobs, A. Silv, nd A. Sokolov. Trce Semntics vi Determiniztion. To pper in Proceedings of CMCS 12, in Lecture Notes in Computer Science. Springer, [24] P.T. Johnstone. Adjoint lifting theorems for ctegories of lgebrs. Bulletin London Mthemticl Society, 7: , [25] C. Jou nd S.A. Smolk. Equivlences, Congruences, nd Complete Axiomtiztions for Probbilistic Processes. In J. Beten nd J.W. Klop (eds), proceedings of CONCUR 90, volume 458 of Lecture Notes in Computer Science, pges , Springer, [26] B. Klin. A colgebric pproch to process equivlence nd coinduction principle for trces. Electronic Notes in Theoreticl Computer Science, 106: , [27] C. Kissig, nd A. Kurz. Generic Trce Logics. In riv: v1 [cs.lo], 2011.