Processes as formal power series: a coinductive approach to denotational semantics

DOI10.1016/j.tcs.2006.05.030zbMath1097.68070OpenAlexW2145669965MaRDI QIDQ2503337

Fabio Gadducci, Michele Boreale

Publication date: 14 September 2006

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2006.05.030

zbMATH Keywords

bisimulationformal power seriesprocess calculicoinductiontesting equivalence

Mathematics Subject Classification ID

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

Related Items

Towards Bialgebraic Semantics for the Linear Time – Branching Time Spectrum ⋮ Final Semantics for Decorated Traces ⋮ Order algebras: a quantitative model of interaction ⋮ A coalgebraic view on decorated traces ⋮ A semiring-based trace semantics for processes with applications to information leakage analysis ⋮ On the Unification of Process Semantics: Observational Semantics

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Simulations in coalgebra
• Extensional equivalences for transition systems
• A calculus of mobile processes. II
• Testing equivalences for processes
• CSP, partial automata, and coalgebras.
• Compositional SOS and beyond: A coalgebraic view of open systems
• Behavioural differential equations: a coinductive calculus of streams, automata, and power series
• Testing equivalence as a bisimulation equivalence
• Terminal coalgebras in well-founded set theory
• On the bisimulation proof method
• Final Coalgebras are Ideal Completions of Initial Algebras
• Mathematical Foundations of Computer Science 2003
• Algebra and Coalgebra in Computer Science
• A Bialgebraic Review of Deterministic Automata, Regular Expressions and Languages
• CONCUR 2005 – Concurrency Theory