Open maps, behavioural equivalences, and congruences
From MaRDI portal
Publication:1389441
DOI10.1016/S0304-3975(97)00085-6zbMATH Open0893.68098OpenAlexW1969735348MaRDI QIDQ1389441FDOQ1389441
Authors: Allan Cheng, Mogens Nielsen 
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
Recommendations
Specification and verification (program logics, model checking, etc.) (68Q60) Categories of machines, automata (18B20)
Cites Work
- Bisimulation from open maps
- Title not available (Why is that?)
- Bisimulation can't be traced
- Title not available (Why is that?)
- A completeness theorem for open maps
- A final coalgebra theorem
- Title not available (Why is that?)
- Finite representations of CCS and TCSP programs by automata and Petri nets
- Title not available (Why is that?)
- A co-induction principle for recursively defined domains
- Concurrent testing of processes
- Observing behaviour categorically
Cited In (11)
- Title not available (Why is that?)
- System theory for system identification.
- Bisimulation relations for dynamical and control systems
- Weighted and branching bisimilarities from generalized open maps
- Open maps, behavioural equivalences, and congruences
- Observing behaviour categorically
- Open maps in concrete categories and branching bisimulation for prefix orders
- Bisimulation relations for dynamical, control, and hybrid systems
- Presheaf models for CCS-like languages
- Paths and simulations
- Title not available (Why is that?)
This page was built for publication: Open maps, behavioural equivalences, and congruences
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1389441)
