Theoretical Computer Science
Theoretical Computer Science - Special volume on Petri nets
A complete axiomatization of timed bisimulation for a class of timed regular behaviours
Theoretical Computer Science
The cones and foci proof technique for timed transition systems
Information Processing Letters
A Calculus of Communicating Systems
A Calculus of Communicating Systems
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
Efficient Scaling-Invariant Checking of Timed Bisimulation
STACS '97 Proceedings of the 14th Annual Symposium on Theoretical Aspects 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
Logics and Models of Real Time: A Survey
Proceedings of the Real-Time: Theory in Practice, REX Workshop
A Modal Characterisation of Observable Machine-Behaviour
CAAP '81 Proceedings of the 6th Colloquium on Trees in Algebra and Programming
On Observing Nondeterminism and Concurrency
Proceedings of the 7th Colloquium on Automata, Languages and Programming
Efficiency of asynchronous systems that communicate asynchronously
ICATPN'00 Proceedings of the 21st international conference on Application and theory of petri nets
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
Timed equivalences for timed event structures
PaCT'05 Proceedings of the 8th international conference on Parallel Computing Technologies
Open Maps and Observational Equivalences for Timed Partial Order Models
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P 2003)
Analysis of Timed Concurrent Models Based on Testing Equivalence
Fundamenta Informaticae
Bisimulation and Open Maps for Timed Transition Systems
Fundamenta Informaticae
| Hi-index | 0.00 |
Timed transition systems are a widely studied model for real-time systems. The intention of the paper is to show the applicability of the general categorical framework of openmaps in order to prove that timed delay equivalence is indeed an equivalence relation in the setting of timed transition systems with invariants. In particular, we define a category of the model under consideration and an accompanying (sub)category of observations to which the corresponding notion of open maps is developed. We then use the open maps framework to obtain an abstract equivalence relation which is established to coincide with timed delay bisimulation.