Mathematical Foundations of Computer Science 2003

DOI10.1007/b11836zbMath1124.68383OpenAlexW2495578842MaRDI QIDQ5431314

Fabio Gadducci, Michele Boreale

Publication date: 7 December 2007

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/b11836

zbMATH Keywords

formal power seriesprocess calculicoinductiontesting equivalence

Mathematics Subject Classification ID

Algebraic theory of languages and automata (68Q70) Semantics in the theory of computing (68Q55) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (4)

Weak Bisimilarity Coalgebraically ⋮ Order algebras: a quantitative model of interaction ⋮ Processes as formal power series: a coinductive approach to denotational semantics ⋮ (Bi)simulations up-to characterise process semantics

This page was built for publication: Mathematical Foundations of Computer Science 2003