The following pages link to Frits W. Vaandrager (Q975884):
Displaying 50 items.
- (Q197382) (redirect page) (← links)
- (Q479470) (redirect page) (← links)
- Improving active Mealy machine learning for protocol conformance testing (Q479471) (← links)
- A note on fairness in I/O automata (Q671616) (← links)
- Analysis of a clock synchronization protocol for wireless sensor networks (Q764293) (← links)
- Switched PIOA: parallel composition via distributed scheduling (Q854167) (← links)
- Analysis of a biphase mark protocol with Uppaal and PVS (Q855013) (← links)
- The axiomatization of override and update (Q975885) (← links)
- Structured operational semantics and bisimulation as a congruence (Q1198952) (← links)
- An algebra for process creation (Q1203719) (← links)
- Turning SOS rules into equations (Q1327393) (← links)
- The difference between splitting in \(n\) and \(n+1\) (Q1370654) (← links)
- Hybrid I/O automata. (Q1427865) (← links)
- Model learning as a satisfiability modulo theories problem (Q1647700) (← links)
- Modular specification of process algebras (Q1802074) (← links)
- Action transducers and timed automata (Q1816917) (← links)
- Linear parametric model checking of timed automata (Q1858447) (← links)
- Forward and backward simulations. I. Untimed Systems (Q1899913) (← links)
- Forward and backward simulations. II: Timing-based systems (Q1923088) (← links)
- Generating models of infinite-state communication protocols using regular inference with abstraction (Q2018056) (← links)
- Simulating parallel internal column contextual array grammars using two-dimensional parallel restarting automata with multiple windows (Q2037380) (← links)
- Combining black-box and white-box techniques for learning register automata (Q2075785) (← links)
- Learning Mealy machines with one timer (Q2232274) (← links)
- Learning unions of \(k\)-testable languages (Q2278288) (← links)
- Determinism \(\to\) (event structure isomorphism \(=\) step sequence equivalence) (Q2638769) (← links)
- (Q2754085) (← links)
- (Q2769587) (← links)
- Learning Register Automata with Fresh Value Generation (Q2787422) (← links)
- Enhancing Automata Learning by Log-Based Metrics (Q2814131) (← links)
- A Theory of History Dependent Abstractions for Learning Interface Automata (Q2914374) (← links)
- The Theory of Timed I/O Automata, Second Edition (Q3002201) (← links)
- The Theory of Timed I/O Automata (Q3006716) (← links)
- (Q3519383) (← links)
- Compositional Abstraction in Real-Time Model Checking (Q3543301) (← links)
- A testing scenario for probabilistic processes (Q3546349) (← links)
- Learning I/O Automata (Q3584922) (← links)
- (Q3771632) (← links)
- (Q4038723) (← links)
- Three logics for branching bisimulation (Q4369871) (← links)
- (Q4449196) (← links)
- (Q4552483) (← links)
- Automata Learning through Counterexample Guided Abstraction Refinement (Q4647827) (← links)
- (Q4865641) (← links)
- (Q4967165) (← links)
- Automata Learning and Galois Connections (Invited Talk) (Q5091152) (← links)
- A theory of normed simulations (Q5277709) (← links)
- Correct Hardware Design and Verification Methods (Q5493241) (← links)
- Theoretical Aspects of Computing - ICTAC 2004 (Q5709998) (← links)
- Formal Modeling and Analysis of Timed Systems (Q5717494) (← links)
- Formal Modeling and Analysis of Timed Systems (Q5717501) (← links)
