Open maps, behavioural equivalences, and congruences

DOI10.1016/S0304-3975(97)00085-6zbMath0893.68098OpenAlexW1969735348MaRDI QIDQ1389441

Mogens Nielsen, Allan Cheng

Publication date: 30 June 1998

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0304-3975(97)00085-6

zbMATH Keywords

process algebracongruencesbisimulationcategory theoryopen maps

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Categories of machines, automata (18B20)

Related Items (5)

Presheaf models for CCS-like languages ⋮ System theory for system identification. ⋮ Bisimulation Relations for Dynamical and Control Systems ⋮ Paths and Simulations ⋮ Bisimulation relations for dynamical, control, and hybrid systems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Finite representations of CCS and TCSP programs by automata and Petri nets
• A co-induction principle for recursively defined domains
• A completeness theorem for open maps
• Concurrent testing of processes
• Bisimulation from open maps
• Observing behaviour categorically
• Bisimulation can't be traced
• A final coalgebra theorem

This page was built for publication: Open maps, behavioural equivalences, and congruences