Algebraic laws for nondeterminism and concurrency
Journal of the ACM (JACM)
Towards an algebra for timed behaviours
Theoretical Computer Science
Theoretical Computer Science
Time and duration in noninterleaving concurrency
Fundamenta Informaticae
Handbook of logic in computer science (vol. 4)
Theoretical Computer Science - Special volume on Petri nets
Analysis of timed concurrent models based on testing equivalence
Fundamenta Informaticae - Special issue on Concurrency specification and programming (CS&P)
Equivalence Notions for Concurrent Systems and Refinement of Actions (Extended Abstract)
MFCS '89 Proceedings on Mathematical Foundations of Computer Science 1989
From Timed Automata to Logic - and Back
MFCS '95 Proceedings of the 20th International Symposium on Mathematical Foundations of Computer Science
Timed Bisimulation and Open Maps
MFCS '98 Proceedings of the 23rd International Symposium on Mathematical Foundations of Computer Science
A constraint-oriented real-time process calculus
FORTE '92 Proceedings of the IFIP TC6/WG6.1 Fifth International Conference on Formal Description Techniques for Distributed Systems and Communication Protocols: Formal Description Techniques, V
Metric Semantics for True Concurrent Real Time
ICALP '98 Proceedings of the 25th International Colloquium on Automata, Languages and Programming
Efficient Scaling-Invariant Checking of Timed Bisimulation
STACS '97 Proceedings of the 14th Annual Symposium on Theoretical Aspects of Computer Science
Layering of Real-Time Distributed Processes
ProCoS Proceedings of the Third International Symposium Organized Jointly with the Working Group Provably Correct Systems on Formal Techniques in Real-Time and Fault-Tolerant Systems
On Specifying Real-Time Systems in a Causality-Based Setting
FTRTFT '96 Proceedings of the 4th International Symposium on Formal Techniques in Real-Time and Fault-Tolerant Systems
Obseving Behaviour Categorically
Proceedings of the 15th Conference on Foundations of Software Technology and Theoretical Computer Science
An introduction to event structures
Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency, School/Workshop
An Overview and Synthesis on Timed Process Algebras
Proceedings of the Real-Time: Theory in Practice, REX Workshop
| Hi-index | 0.00 |
The intention of the paper is first to show the applicability of the general categorical framework of open maps to the setting of true concurrent models with dense time. In particular, we define a category of timed event structures and an accompanying path (sub)category of timed words. Then we use the framework of open maps to obtain an abstract notion of bisimulation which is established to be equivalent to the standard notion of timed bisimulation. Using the fact, we finally show decidability of timed bisimulation in the setting of finite timed structures.