Simplified Coalgebraic Trace Equivalence
From MaRDI portal
Publication:5256339
DOI10.1007/978-3-319-15545-6_8zbMath1453.68112arXiv1410.2463MaRDI 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
68Q85: Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.)
Related Items
Steps and traces, Iterated covariant powerset is not a monad, Coalgebraic trace semantics via forgetful logics
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- 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