Unifying equivalences for timed transition systems
From MaRDI portal
Cites work
- A Coalgebraic Characterization of Behaviours in the Linear Time – Branching Time Spectrum
- A completeness theorem for open maps
- A final coalgebra theorem
- Barbed bisimulation
- Bisimulation from open maps
- Causal testing
- Coalgebra morphisms subsume open maps
- Coalgebraic semantics for timed processes
- Efficient scaling-invariant checking of timed bisimulation
- Formal Methods for the Design of Real-Time Systems
- Formal Modeling and Analysis of Timed Systems
- scientific article; zbMATH DE number 1339961 (Why is no real title available?)
- scientific article; zbMATH DE number 1497803 (Why is no real title available?)
- scientific article; zbMATH DE number 2104639 (Why is no real title available?)
- Observational equivalences for timed stable event structures
- Open Maps Bisimulations for Higher Dimensional Automata Models
- Refinement of actions and equivalence notions for concurrent systems
- Simulations in coalgebra
- Testing equivalences for processes
- Timed delay bisimulation is an equivalence relation for timed transition systems
- Timers for distributed systems
- Towards a unified view of bisimulation: A comparative study
- Universal coalgebra: A theory of systems
This page was built for publication: Unifying equivalences for timed transition systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6874937)