scientific article; zbMATH DE number 6932683

DOI10.23638/LMCS-14(3:15)2018MaRDI QIDQ4585069

Ichiro Hasuo, Natsuki Urabe

Publication date: 6 September 2018

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

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

simulationcoalgebracategory theorytrace semanticsinfinite trace

Mathematics Subject Classification ID

Logic in computer science (03B70) Computer science (68-XX)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Behavioural equivalences for coalgebras with unobservable moves
• Least fixed point of a functor
• Constructive versions of Tarski's fixed point theorems
• Undecidable problems for probabilistic automata of fixed dimension
• Greatest fixed points of probabilistic min/max polynomial equations, and reachability for branching Markov decision processes
• A classification of accessible categories
• Forward and backward simulations. I. Untimed Systems
• Coalgebraic Trace Semantics for Continuous Probabilistic Transition Systems
• Trace Semantics via Determinization
• Generic Infinite Traces and Path-Based Coalgebraic Temporal Logics
• Generic Forward and Backward Simulations III: Quantitative Simulations by Matrices
• Generic Forward and Backward Simulations II: Probabilistic Simulation
• Terminal Coalgebras for Measure-Polynomial Functors
• Coalgebraic Infinite Traces and Kleisli Simulations
• Generic Trace Semantics via Coinduction
• Probabilistic tree automata
• Generic Forward and Backward Simulations
• Lifting theorems for Kleisli categories

This page was built for publication: