Simplified Coalgebraic Trace Equivalence

DOI10.1007/978-3-319-15545-6_8zbMath1453.68112arXiv1410.2463OpenAlexW1951729275MaRDI QIDQ5256339

Lutz Schröder, Stefan Milius, Dirk Pattinson, Alexander Kurz

Publication date: 22 June 2015

Published in: Software, Services, and Systems (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1410.2463

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (3)

Iterated covariant powerset is not a monad ⋮ Coalgebraic trace semantics via forgetful logics ⋮ Steps and traces

Cites Work

• On the final sequence of a finitary set functor
• Coequalizers and free triples
• Trace Semantics via Determinization
• Sound and Complete Axiomatizations of Coalgebraic Language Equivalence
• Final Semantics for Decorated Traces
• A unified treatment of transfinite constructions for free algebras, free monoids, colimits, associated sheaves, and so on
• Generalizing determinization from automata to coalgebras
• Reactive Systems
• A Coalgebraic Approach to Linear-Time Logics
• Generic Trace Semantics via Coinduction
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Simplified Coalgebraic Trace Equivalence