A Coalgebraic Approach to Linear-Time Logics
From MaRDI portal
Publication:5410688
DOI10.1007/978-3-642-54830-7_28zbMath1405.68192OpenAlexW2118222259MaRDI QIDQ5410688
Publication date: 16 April 2014
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-54830-7_28
Abstract data types; algebraic specification (68Q65) Categorical logic, topoi (03G30) Temporal logic (03B44) Categories of machines, automata (18B20) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)
Related Items (7)
Generic weakest precondition semantics from monads enriched with order ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Coalgebraic trace semantics via forgetful logics ⋮ Unnamed Item ⋮ Steps and traces ⋮ Simplified Coalgebraic Trace Equivalence
This page was built for publication: A Coalgebraic Approach to Linear-Time Logics