| Publication | Date of Publication | Type |
|---|
Action codes
| 2024-11-14 | Paper |
Automata with timers
| 2024-05-03 | Paper |
Relating alternating relations for conformance and refinement
| 2024-04-19 | Paper |
Learning Mealy machines with one timer
Information and Computation | 2024-02-02 | Paper |
A new approach for active automata learning based on apartness
| 2024-01-23 | Paper |
Benchmarks for automata learning and conformance testing
Lecture Notes in Computer Science | 2023-08-02 | Paper |
Grey-Box Learning of Register Automata
| 2023-03-21 | Paper |
Automata Learning and Galois Connections (Invited Talk)
| 2022-07-21 | Paper |
A Myhill-Nerode theorem for register automata and symbolic trace languages
Theoretical Computer Science | 2022-04-01 | Paper |
Combining black-box and white-box techniques for learning register automata
| 2022-02-16 | Paper |
Learning Mealy machines with one timer
| 2021-10-04 | Paper |
A Myhill-Nerode theorem for register automata and symbolic trace languages
Theoretical Aspects of Computing – ICTAC 2020 | 2021-07-08 | Paper |
Simulating parallel internal column contextual array grammars using two-dimensional parallel restarting automata with multiple windows
| 2021-07-01 | Paper |
Learning unions of \(k\)-testable languages
| 2019-12-04 | Paper |
scientific article; zbMATH DE number 7075870 (Why is no real title available?)
| 2019-07-03 | Paper |
Model learning as a satisfiability modulo theories problem
| 2018-06-26 | Paper |
A theory of normed simulations
ACM Transactions on Computational Logic | 2017-07-12 | Paper |
Enhancing Automata Learning by Log-Based Metrics
Lecture Notes in Computer Science | 2016-06-17 | Paper |
Learning register automata with fresh value generation
Theoretical Aspects of Computing - ICTAC 2015 | 2016-02-25 | Paper |
Generating models of infinite-state communication protocols using regular inference with abstraction
Formal Methods in System Design | 2015-03-24 | Paper |
Improving active Mealy machine learning for protocol conformance testing
Machine Learning | 2014-12-05 | Paper |
Automata Learning through Counterexample Guided Abstraction Refinement
FM 2012: Formal Methods | 2012-11-08 | Paper |
A theory of history dependent abstractions for learning interface automata
Lecture Notes in Computer Science | 2012-09-25 | Paper |
Analysis of a clock synchronization protocol for wireless sensor networks
Theoretical Computer Science | 2012-03-13 | Paper |
The Theory of Timed I/O Automata
Synthesis Lectures on Computer Science | 2011-06-21 | Paper |
The theory of timed I/O automata
Synthesis Lectures on Distributed Computing Theory | 2011-05-20 | Paper |
Learning I/O automata
CONCUR 2010 - Concurrency Theory | 2010-08-31 | Paper |
The axiomatization of override and update
Journal of Applied Logic | 2010-06-11 | Paper |
CONCUR 2003 - Concurrency Theory
Lecture Notes in Computer Science | 2010-03-30 | Paper |
Bundle event structures and CCSP.
Lecture Notes in Computer Science | 2010-03-30 | Paper |
A testing scenario for probabilistic processes
Journal of the ACM | 2008-12-21 | Paper |
Compositional Abstraction in Real-Time Model Checking
Lecture Notes in Computer Science | 2008-12-02 | Paper |
Observing branching structure through probabilistic contexts
| 2008-08-14 | Paper |
Analysis of a biphase mark protocol with Uppaal and PVS
Formal Aspects of Computing | 2006-12-20 | Paper |
Switched PIOA: parallel composition via distributed scheduling
Theoretical Computer Science | 2006-12-07 | Paper |
Correct Hardware Design and Verification Methods
Lecture Notes in Computer Science | 2006-10-20 | Paper |
Formal Modeling and Analysis of Timed Systems
Lecture Notes in Computer Science | 2006-01-10 | Paper |
Formal Modeling and Analysis of Timed Systems
Lecture Notes in Computer Science | 2006-01-10 | Paper |
Theoretical Aspects of Computing - ICTAC 2004
Lecture Notes in Computer Science | 2005-11-30 | Paper |
Hybrid I/O automata.
Information and Computation | 2004-03-14 | Paper |
scientific article; zbMATH DE number 2038731 (Why is no real title available?)
| 2004-02-08 | Paper |
Linear parametric model checking of timed automata
The Journal of Logic and Algebraic Programming | 2003-02-13 | Paper |
scientific article; zbMATH DE number 1794382 (Why is no real title available?)
| 2002-09-03 | Paper |
scientific article; zbMATH DE number 1701759 (Why is no real title available?)
| 2002-02-05 | Paper |
scientific article; zbMATH DE number 1670779 (Why is no real title available?)
| 2001-11-11 | Paper |
Testing timed automata
Theoretical Computer Science | 2001-08-20 | Paper |
Three logics for branching bisimulation
Journal of the ACM | 1998-02-02 | Paper |
The difference between splitting in \(n\) and \(n+1\)
Information and Computation | 1997-10-26 | Paper |
A note on fairness in I/O automata
Information Processing Letters | 1997-02-27 | Paper |
Action transducers and timed automata
Formal Aspects of Computing | 1996-12-01 | Paper |
Forward and backward simulations. II: Timing-based systems
Information and Computation | 1996-10-01 | Paper |
scientific article; zbMATH DE number 845622 (Why is no real title available?)
| 1996-03-27 | Paper |
Forward and backward simulations. I. Untimed Systems
Information and Computation | 1995-11-14 | Paper |
Turning SOS rules into equations
Information and Computation | 1994-06-19 | Paper |
Modular specification of process algebras
Theoretical Computer Science | 1993-08-08 | Paper |
scientific article; zbMATH DE number 177845 (Why is no real title available?)
| 1993-05-18 | Paper |
An algebra for process creation
Acta Informatica | 1993-02-22 | Paper |
Structured operational semantics and bisimulation as a congruence
Information and Computation | 1993-01-16 | Paper |
Determinism \(\to\) (event structure isomorphism \(=\) step sequence equivalence)
Theoretical Computer Science | 1991-01-01 | Paper |
scientific article; zbMATH DE number 4030999 (Why is no real title available?)
| 1987-01-01 | Paper |
