| A Myhill-Nerode theorem for register automata and symbolic trace languages | 0 | 0.34 | 2022 |
| A New Approach for Active Automata Learning Based on Apartness | 0 | 0.34 | 2022 |
| Learning Unions of k-Testable Languages. | 1 | 0.36 | 2019 |
| Relating Alternating Relations For Conformance And Refinement | 0 | 0.34 | 2019 |
| Model learning. | 7 | 0.58 | 2017 |
| Model learning and model checking of SSH implementations | 0 | 0.34 | 2017 |
| Learning Pairwise Disjoint Simple Languages from Positive Examples. | 0 | 0.34 | 2017 |
| Modeling task systems using parameterized partial orders | 1 | 0.36 | 2012 |
| A theory of history dependent abstractions for learning interface automata | 6 | 0.46 | 2012 |
| Analysis of a clock synchronization protocol for wireless sensor networks | 24 | 1.20 | 2012 |
| Verification of printer datapaths using timed automata | 4 | 0.45 | 2010 |
| Inference and abstraction of the biometric passport | 34 | 1.36 | 2010 |
| Model-driven design-space exploration for embedded systems: the octopus toolset | 22 | 0.93 | 2010 |
| Generating models of infinite-state communication protocols using regular inference with abstraction. | 42 | 1.35 | 2010 |
| Fortuna: Model Checking Priced Probabilistic Timed Automata | 4 | 1.88 | 2010 |
| Using model checkers in an introductory course on operating systems | 5 | 0.46 | 2008 |
| Formal Modeling and Scheduling of Datapaths of Digital Document Printers | 9 | 0.59 | 2008 |
| Compositional Abstraction in Real-Time Model Checking | 10 | 0.68 | 2008 |
| A testing scenario for probabilistic processes | 31 | 0.97 | 2007 |
| Analysis of the zeroconf protocol using UPPAAL | 12 | 0.65 | 2006 |
| Switched PIOA: parallel composition via distributed scheduling | 31 | 1.03 | 2006 |
| Specifying Urgency in Timed I/O Automata | 16 | 0.70 | 2005 |
| Deadlock prevention in the ÆTHEREAL protocol | 20 | 1.16 | 2005 |
| Switched probabilistic i/o automata | 8 | 0.53 | 2004 |
| A theory of normed simulations | 4 | 0.41 | 2004 |
| Modeling and Verifying a Lego Car Using Hybrid I/O Automata | 5 | 0.59 | 2003 |
| Timed I/O Automata: A Mathematical Framework for Modeling and Analyzing Real-Time Systems | 62 | 2.31 | 2003 |
| Hybrid I/O automata | 266 | 23.85 | 2003 |
| Testing timed automata | 83 | 3.08 | 2001 |
| Verification of a Leader Election Protocol: Formal Methods Applied to IEEE 1394 | 24 | 1.77 | 2000 |
| The difference between splitting in n and n + 1 | 25 | 1.58 | 1997 |
| Strategic directions in concurrency research | 21 | 3.04 | 1996 |
| A note on fairness in I/O automata | 4 | 1.05 | 1996 |
| Three logics for branching bisimulation | 158 | 7.74 | 1995 |
| Turning SOS rules into equations | 80 | 3.77 | 1992 |
| Structured operational semantics and bisimulation as a congruence | 216 | 19.10 | 1992 |
| An efficient algorithm for branching bisimulation and stuttering equivalence | 123 | 8.98 | 1990 |
| Action versus state based logics for transition systems | 173 | 7.25 | 1990 |
| Back and forth bisimulations | 40 | 3.23 | 1990 |
