Bisimulation for probabilistic transition systems: a coalgebraic approach
Theoretical Computer Science
Bisimulation open maps for timed transition systems
Fundamenta Informaticae - Special issue dedicated to A. Salomaa
Towards a unified view of bisimulation: a comparative study
Theoretical Computer Science
Universal coalgebra: a theory of systems
Theoretical Computer Science - Modern algebra and its applications
A Coalgebraic presentation of structured transition systems
Theoretical Computer Science
The cones and foci proof technique for timed transition systems
Information Processing Letters
Process Algebra with Timing
Deciding Testing Equivalence for Real-Time Processes with Dense Time
MFCS '93 Proceedings of the 18th International Symposium on Mathematical Foundations of Computer Science
CONCUR '92 Proceedings of the Third International Conference on Concurrency Theory
The Observational Power of Clocks
CONCUR '94 Proceedings of the Concurrency Theory
Obseving Behaviour Categorically
Proceedings of the 15th Conference on Foundations of Software Technology and Theoretical Computer Science
Decidability of Bisimulation Equivalences for Parallel Timer Processes
CAV '92 Proceedings of the Fourth International Workshop on Computer Aided Verification
Category Theory and Computer Science
Higher Dimensional Transition Systems
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
Open Maps and Observational Equivalences for Timed Partial Order Models
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P 2003)
Observational Equivalences for Timed Stable Event Structures
Fundamenta Informaticae - SPECIAL ISSUE ON CONCURRENCY SPECIFICATION AND PROGRAMMING (CS&P 2005) Ruciane-Nide, Poland, 28-30 September 2005
Timed Delay Bisimulation is an Equivalence Relation for Timed Transition Systems
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)
A Coalgebraic Characterization of Behaviours in the Linear Time --- Branching Time Spectrum
Recent Trends in Algebraic Development Techniques
Weak Bisimulation for Action-Type Coalgebras
Electronic Notes in Theoretical Computer Science (ENTCS)
Bisimulation and cocongruence for probabilistic systems
Information and Computation - Special issue: Seventh workshop on coalgebraic methods in computer science 2004
Coalgebraic semantics for timed processes
Information and Computation - Special issue: Seventh workshop on coalgebraic methods in computer science 2004
Open maps bisimulations for higher dimensional automata models
FCT'09 Proceedings of the 17th international conference on Fundamentals of computation theory
Time supervision of concurrent systems using symbolic unfoldings of time petri nets
FORMATS'05 Proceedings of the Third international conference on Formal Modeling and Analysis of Timed Systems
Quantifying similarities between timed systems
FORMATS'05 Proceedings of the Third international conference on Formal Modeling and Analysis of Timed Systems
Is timed branching bisimilarity an equivalence indeed?
FORMATS'05 Proceedings of the Third international conference on Formal Modeling and Analysis of Timed Systems
An accessible approach to behavioural pseudometrics
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
| Hi-index | 0.00 |
Timed transition systems are a widely studied model for real-time systems The intention of the paper is twofold: first to show the applicability of the general categorical framework of open maps in order to prove that timed weak bisimulation is indeed an equivalence relation, and, second, to investigate how several categorical (open maps, path-bisimilarity and coalgebra based) approaches to an abstract characterization of bisimulation relate to each other and to timed weak bisimulation, in the setting of timed transition systems.