Bisimulation indexes and their applications
Theoretical Computer Science
A real-time process algebra with open intervals and maximal progress
Nordic Journal of Computing
Task automata: Schedulability, decidability and undecidability
Information and Computation
Characterize branching distance in terms of (η,α)-bisimilarity
Information and Computation
Comparing the Expressiveness of Timed Automata and Timed Extensions of Petri Nets
FORMATS '08 Proceedings of the 6th international conference on Formal Modeling and Analysis of Timed Systems
Verifying Stateful Timed CSP Using Implicit Clocks and Zone Abstraction
ICFEM '09 Proceedings of the 11th International Conference on Formal Engineering Methods: Formal Methods and Software Engineering
Sampled universality of timed automata
FOSSACS'07 Proceedings of the 10th international conference on Foundations of software science and computational structures
Weak bisimulation for Probabilistic Timed Automata
Theoretical Computer Science
Performance model checking scenario-aware dataflow
FORMATS'11 Proceedings of the 9th international conference on Formal modeling and analysis of timed systems
On sampled semantics of timed systems
FSTTCS '05 Proceedings of the 25th international conference on Foundations of Software Technology and Theoretical Computer Science
Forgetting the time in timed process algebra: timeless behaviour in a timestamped world
FMOODS'10/FORTE'10 Proceedings of the 12th IFIP WG 6.1 international conference and 30th IFIP WG 6.1 international conference on Formal Techniques for Distributed Systems
ACM Computing Surveys (CSUR)
Model checking for probabilistic timed automata
Formal Methods in System Design
| Hi-index | 0.00 |