Fundamenta Informaticae
Is Timed Branching Bisimilarity a Congruence Indeed?
Fundamenta Informaticae
Timed Delay Bisimulation is an Equivalence Relation for Timed Transition Systems
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)
Formal Verification of Timed Systems Using Cones and Foci
Electronic Notes in Theoretical Computer Science (ENTCS)
Cones and foci for protocol verification revisited
FOSSACS'03/ETAPS'03 Proceedings of the 6th International conference on Foundations of Software Science and Computation Structures and joint European conference on Theory and practice of software
Action abstraction in timed process algebra: the case for an untimed silent step
FSEN'07 Proceedings of the 2007 international conference on Fundamentals of software engineering
Is timed branching bisimilarity an equivalence indeed?
FORMATS'05 Proceedings of the Third international conference on Formal Modeling and Analysis of Timed Systems
A categorical view of timed weak bisimulation
TAMC'10 Proceedings of the 7th annual conference on Theory and Applications of Models of Computation
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
Timed Delay Bisimulation is an Equivalence Relation for Timed Transition Systems
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)
Is Timed Branching Bisimilarity a Congruence Indeed?
Fundamenta Informaticae
Fundamenta Informaticae
| Hi-index | 0.89 |