No. |
Title |
Author |
Year |
---|

1 |
Communicating Finite-State Machines and Two-Variable Logic |
Bollig, Benedikt et al. |
2018 |

2 |
It Is Easy to Be Wise After the Event: Communicating Finite-State Machines Capture First-Order Logic with "Happened Before" |
Bollig, Benedikt et al. |
2018 |

3 |
Reachability in Timed Automata with Diagonal Constraints |
Gastin, Paul et al. |
2018 |

4 |
Towards an Efficient Tree Automata Based Technique for Timed Systems |
Akshay, S. et al. |
2017 |

5 |
Analyzing Timed Systems Using Tree Automata |
Akshay, S. et al. |
2016 |

6 |
An Automata-Theoretic Approach to the Verification of Distributed Algorithms |
Aiswarya, Cyriac et al. |
2015 |

7 |
Parameterized Communicating Automata: Complementation and Model Checking |
Bollig, Benedikt et al. |
2014 |

8 |
Quantitative Models: Expressiveness, Analysis, and New Applications (Dagstuhl Seminar 14041) |
Droste, Manfred et al. |
2014 |

9 |
Reasoning About Distributed Systems: WYSIWYG (Invited Talk) |
Cyriac, Aiswarya et al. |
2014 |

10 |
10031 Abstracts Collection -- Quantitative Models: Expressiveness and Analysis |
Baier, Christel et al. |
2010 |