Real-time behaviour of asynchronous agents
CONCUR '90 Proceedings on Theories of concurrency : unification and extension: unification and extension
From ATP to timed graphs and hybrid systems
Acta Informatica
Theoretical Computer Science
Presheaves as transition systems
POMIV '96 Proceedings of the DIMACS workshop on Partial order methods in verification
Communication and Concurrency
Modelling with Generalized Stochastic Petri Nets
ACM SIGMETRICS Performance Evaluation Review - Special issue on Stochastic Petri Nets
An Asynchronous Algebra with Multiple Clocks
ESOP '94 Proceedings of the 5th European Symposium on Programming: Programming Languages and Systems
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
Automata For Modeling Real-Time Systems
ICALP '90 Proceedings of the 17th International Colloquium on Automata, Languages and Programming
Automatic Synthesis of Real Time Systems
ICALP '95 Proceedings of the 22nd 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
Decidability of Bisimulation Equivalences for Parallel Timer Processes
CAV '92 Proceedings of the Fourth International Workshop on Computer Aided Verification
Model-Checking for Real-Time Systems
FCT '95 Proceedings of the 10th International Symposium on Fundamentals of Computation Theory
Logics and Models of Real Time: A Survey
Proceedings of the Real-Time: Theory in Practice, REX Workshop
A Kleene theorem for timed automata
LICS '97 Proceedings of the 12th Annual IEEE Symposium on Logic in Computer Science
A Theory of Recursive Domains with Applications to Concurrency
LICS '98 Proceedings of the 13th Annual IEEE Symposium on Logic in Computer Science
Timed Delay Bisimulation is an Equivalence Relation for Timed Transition Systems
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)
Open Maps and Observational Equivalences for Timed Partial Order Models
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P 2003)
A categorical observation of timed testing equivalence
PaCT'07 Proceedings of the 9th international conference on Parallel Computing Technologies
| Hi-index | 0.00 |
Formal models for real-time systems have been studied intensively over the past decade. Much of the theory of untimed systems have been lifted to real-time settings. One example is the notion of bisimulation applied to timed transition systems, which is studied here within the general categorical framework of open maps. We define a category of timed transition systems, and show how to characterise standard timed bisimulation in terms of spans of open maps with a natural choice of a path category. This allows us to apply general results from the theory of open maps, e.g. the existence of canonical models and characteristic logics. Also, we obtain here an alternative proof of decidability of bisimulation for finite transition systems, and illustrate the use of open maps in finite presentations of bisimulations