Bisimulation of Labelled State-to-Function Transition Systems Coalgebraically

DOI10.2168/LMCS-11(4:16)2015zbMath1448.68345arXiv1511.05866OpenAlexW2248132030MaRDI QIDQ3460420

E. P. de Vink, Diego Latella, Mieke Massink

Publication date: 7 January 2016

Published in: Logical Methods in Computer Science (Search for Journal in Brave)

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

zbMATH Keywords

coalgebrabisimulationbehavioral equivalencefunction of finite supportFuTSquantitative process algebra

Mathematics Subject Classification ID

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

Related Items (3)

\textsc{ULTraS} at work: compositionality metaresults for bisimulation and trace semantics ⋮ Towards general axiomatizations for bisimilarity and trace semantics ⋮ Unnamed Item

Uses Software

• MoDeST
• MarCaSPiS

This page was built for publication: Bisimulation of Labelled State-to-Function Transition Systems Coalgebraically