Number of the records: 1  

Coinduction in concurrent timed systems

  1. 1.
    0348268 - MÚ 2011 RIV NL eng J - Journal Article
    Komenda, Jan
    Coinduction in concurrent timed systems.
    Electronic Notes in Theoretical Computer Science. Roč. 264, č. 2 (2010), s. 177-197. ISSN 1571-0661
    Grant - others:EU Projekt(XE) EU.ICT.DISC 224498
    Institutional research plan: CEZ:AV0Z10190503
    Keywords : timed discrete-event systems * partial Mealy automata * functional stream calculus * synchronous composition
    Subject RIV: BA - General Mathematics
    http://www.sciencedirect.com/science/article/pii/S1571066110000794

    An important class of timed transition systems can be modeled by deterministic weighted automata, which are essentially partial Mealy automata, and their extensions using synchronous compositions defined over extended alphabets. From a coalgebraic viewpoint, behaviours of deterministic partial Mealy automata are causal and length preserving partial functions between finite and infinite sequences of inputs and outputs, called stream functionals. After a study of fundamental properties of functional stream calculus an application to the definition by coinduction of the synchronous product of stream functionals is proposed.
    Permanent Link: http://hdl.handle.net/11104/0188842

     
    FileDownloadSizeCommentaryVersionAccess
    Komenda.pdf1416.1 KBPublisher’s postprintrequire
     
Number of the records: 1  

  This site uses cookies to make them easier to browse. Learn more about how we use cookies.