×

Found 8 Documents (Results 1–8)

Explaining behavioural inequivalence generically in quasilinear time. (English) Zbl 07730634

Haddad, Serge (ed.) et al., 32nd international conference on concurrency theory, CONCUR 2021, August 24–27, 2021, virtual conference. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 203, Article 32, 18 p. (2021).
MSC:  68Q85
PDFBibTeX XMLCite
Full Text: DOI arXiv

Predicate liftings and functor presentations in coalgebraic expression languages. (English) Zbl 1519.68146

Cîrstea, Corina (ed.), Coalgebraic methods in computer science. 14th IFIP WG 1.3 international workshop, CMCS 2018, colocated with ETAPS 2018, Thessaloniki, Greece, April 14–15, 2018. Revised selected papers. Cham: Springer. Lect. Notes Comput. Sci. 11202, 56-77 (2018).
MSC:  68Q65 03G30 18C50
PDFBibTeX XMLCite
Full Text: DOI arXiv

Efficient coalgebraic partition refinement. (English) Zbl 1442.68112

Meyer, Roland (ed.) et al., 28th international conference on concurrency theory. CONCUR 2017, Berlin, Germany, September 5–8, 2017. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 85, Article 32, 16 p. (2017).
PDFBibTeX XMLCite
Full Text: DOI arXiv

Nominal automata with name binding. (English) Zbl 1486.68097

Esparza, Javier (ed.) et al., Foundations of software science and computation structures. 20th international conference, FOSSACS 2017, held as part of the European joint conferences on theory and practice of software, ETAPS 2017, Uppsala, Sweden, April 22–29, 2017. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 10203, 124-142 (2017).
MSC:  68Q45
PDFBibTeX XMLCite
Full Text: DOI arXiv

Filter Results by …

Document Type

all top 5

Year of Publication

all top 3

Main Field

all top 3

Software