Frits W. Vaandrager

Orcid: 0000-0003-3955-1910

Affiliations:
  • Radboud University, Nijmegen, The Netherlands


According to our database1, Frits W. Vaandrager authored at least 110 papers between 1987 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Active Learning of Mealy Machines with Timers.
CoRR, 2024

2023
Learning Mealy machines with one timer.
Inf. Comput., December, 2023

Lower Bounds for Active Automata Learning.
Proceedings of the International Conference on Grammatical Inference, 2023

Action Codes.
Proceedings of the 50th International Colloquium on Automata, Languages, and Programming, 2023

Automata with Timers.
Proceedings of the Formal Modeling and Analysis of Timed Systems, 2023

2022
A Myhill-Nerode theorem for register automata and symbolic trace languages.
Theor. Comput. Sci., 2022

A New Approach for Active Automata Learning Based on Apartness.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2022

2021
State identification for labeled transition systems with inputs and outputs.
Sci. Comput. Program., 2021

Active Automata Learning: from L<sup>*</sup> to L<sup>#</sup>.
Proceedings of the Formal Methods in Computer Aided Design, 2021

2020
Simulating Parallel Internal Column Contextual Array Grammars Using Two-Dimensional Parallel Restarting Automata with Multiple Windows.
Proceedings of the Combinatorial Image Analysis - 20th International Workshop, 2020

Grey-Box Learning of Register Automata.
Proceedings of the Integrated Formal Methods - 16th International Conference, 2020

2019
Combining Black-Box and White-Box Techniques for Learning Register Automata.
Proceedings of the Computing and Software Science - State of the Art and Perspectives, 2019

RERS 2019: Combining Synthesis with Real-World Models.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2019

Learning Unions of k-Testable Languages.
Proceedings of the Language and Automata Theory and Applications, 2019

Relating Alternating Relations for Conformance and Refinement.
Proceedings of the Integrated Formal Methods - 15th International Conference, 2019

Automata Learning and Galois Connections (Invited Talk).
Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, 2019

2018
Model Learning as a Satisfiability Modulo Theories Problem.
Proceedings of the Language and Automata Theory and Applications, 2018

Benchmarks for Automata Learning and Conformance Testing.
Proceedings of the Models, Mindsets, 2018

2017
Learning Pairwise Disjoint Simple Languages from Positive Examples.
CoRR, 2017

Model learning.
Commun. ACM, 2017

Model learning and model checking of SSH implementations.
Proceedings of the 24th ACM SIGSOFT International SPIN Symposium on Model Checking of Software, 2017

2016
Refactoring of Legacy Software Using Model Learning and Equivalence Checking: An Industrial Experience Report.
Proceedings of the Integrated Formal Methods - 12th International Conference, 2016

Enhancing Automata Learning by Log-Based Metrics.
Proceedings of the Integrated Formal Methods - 12th International Conference, 2016

Combining Model Learning and Model Checking to Analyze TCP Implementations.
Proceedings of the Computer Aided Verification - 28th International Conference, 2016

2015
Generating models of infinite-state communication protocols using regular inference with abstraction.
Formal Methods Syst. Des., 2015

Learning Register Automata with Fresh Value Generation.
Proceedings of the Theoretical Aspects of Computing - ICTAC 2015, 2015

Applying Automata Learning to Embedded Control Software.
Proceedings of the Formal Methods and Software Engineering, 2015

2014
Improving active Mealy machine learning for protocol conformance testing.
Mach. Learn., 2014

Recreational Formal Methods: Designing Vacuum Cleaning Trajectories.
Bull. EATCS, 2014

Algorithms for Inferring Register Automata - A Comparison of Existing Approaches.
Proceedings of the Leveraging Applications of Formal Methods, Verification and Validation. Technologies for Mastering Change, 2014

Bigger is Not Always Better: on the Quality of Hypotheses in Active Automata Learning.
Proceedings of the 12th International Conference on Grammatical Inference, 2014

Learning Fragments of the TCP Network Protocol.
Proceedings of the Formal Methods for Industrial Critical Systems, 2014

2013
Modeling task systems using parameterized partial orders.
Int. J. Softw. Tools Technol. Transf., 2013

Extending UPPAAL for the Modeling and Verification of Dynamic Real-Time Systems.
Proceedings of the Fundamentals of Software Engineering - 5th International Conference, 2013

2012
Analysis of a clock synchronization protocol for wireless sensor networks.
Theor. Comput. Sci., 2012

Learning and Testing the Bounded Retransmission Protocol.
Proceedings of the Eleventh International Conference on Grammatical Inference, 2012

Active Learning of Extended Finite State Machines.
Proceedings of the Testing Software and Systems, 2012

Automata Learning through Counterexample Guided Abstraction Refinement.
Proceedings of the FM 2012: Formal Methods, 2012

Reconstructing Critical Paths from Execution Traces.
Proceedings of the 15th IEEE International Conference on Computational Science and Engineering, 2012

A Theory of History Dependent Abstractions for Learning Interface Automata.
Proceedings of the CONCUR 2012 - Concurrency Theory - 23rd International Conference, 2012

2011
Formal specification and analysis of zeroconf using uppaalS.
ACM Trans. Embed. Comput. Syst., 2011

2010
The Theory of Timed I/O Automata, Second Edition
Synthesis Lectures on Distributed Computing Theory, Morgan & Claypool Publishers, ISBN: 978-3-031-02003-2, 2010

The axiomatization of override and update.
J. Appl. Log., 2010

Fortuna: Model Checking Priced Probabilistic Timed Automata.
Proceedings of the QEST 2010, 2010

Verification of Printer Datapaths Using Timed Automata.
Proceedings of the Leveraging Applications of Formal Methods, Verification, and Validation, 2010

Inference and Abstraction of the Biometric Passport.
Proceedings of the Leveraging Applications of Formal Methods, Verification, and Validation, 2010

Learning I/O Automata.
Proceedings of the CONCUR 2010 - Concurrency Theory, 21th International Conference, 2010

2009
Modelling Clock Synchronization in the Chess gMAC WSN Protocol
Proceedings of the Proceedings First Workshop on Quantitative Formal Methods: Theory and Applications, 2009

Adaptive Scheduling of Data Paths using Uppaal Tiga
Proceedings of the Proceedings First Workshop on Quantitative Formal Methods: Theory and Applications, 2009

2008
Using model checkers in an introductory course on operating systems.
ACM SIGOPS Oper. Syst. Rev., 2008

Formal Modeling and Scheduling of Datapaths of Digital Document Printers.
Proceedings of the Formal Modeling and Analysis of Timed Systems, 2008

Compositional Abstraction in Real-Time Model Checking.
Proceedings of the Formal Modeling and Analysis of Timed Systems, 2008

2007
Observing Branching Structure through Probabilistic Contexts.
SIAM J. Comput., 2007

A testing scenario for probabilistic processes.
J. ACM, 2007

2006
The Theory of Timed I/O Automata
Synthesis Lectures on Computer Science, Morgan & Claypool Publishers, 2006

Switched PIOA: Parallel composition via distributed scheduling.
Theor. Comput. Sci., 2006

Model checker aided design of a controller for a wafer scanner.
Int. J. Softw. Tools Technol. Transf., 2006

Analysis of a biphase mark protocol with Uppaaland PVS.
Formal Aspects Comput., 2006

Analysis of the zeroconf protocol using UPPAAL.
Proceedings of the 6th ACM & IEEE International conference on Embedded software, 2006

2005
Specifying Urgency in Timed I/O Automata.
Proceedings of the Third IEEE International Conference on Software Engineering and Formal Methods (SEFM 2005), 2005

Deadlock Prevention in the Æthereal Protocol.
Proceedings of the Correct Hardware Design and Verification Methods, 2005

2004
A theory of normed simulations.
ACM Trans. Comput. Log., 2004

Switched Probabilistic I/O Automata.
Proceedings of the Theoretical Aspects of Computing, 2004

2003
Hybrid I/O automata.
Inf. Comput., 2003

Timed I/O Automata: A Mathematical Framework for Modeling and Analyzing Real-Time Systems.
Proceedings of the 24th IEEE Real-Time Systems Symposium (RTSS 2003), 2003

Modeling and Verifying a Lego Car Using Hybrid I/O Automata.
Proceedings of the 3rd International Conference on Quality Software (QSIC 2003), 2003

A Testing Scenario for Probabilistic Automata.
Proceedings of the Automata, Languages and Programming, 30th International Colloquium, 2003

Adding Symmetry Reduction to Uppaal.
Proceedings of the Formal Modeling and Analysis of Timed Systems: First International Workshop, 2003

Control Synthesis for a Smart Card Personalization System Using Symbolic Model Checking.
Proceedings of the Formal Modeling and Analysis of Timed Systems: First International Workshop, 2003

Cost-Optimization of the IPv4 Zeroconf Protocol.
Proceedings of the 2003 International Conference on Dependable Systems and Networks (DSN 2003), 2003

Compositionality for Probabilistic Automata.
Proceedings of the CONCUR 2003, 2003

Bundle Event Structures and CCSP.
Proceedings of the CONCUR 2003, 2003

2002
Linear parametric model checking of timed automata.
J. Log. Algebraic Methods Program., 2002

2001
Testing timed automata.
Theor. Comput. Sci., 2001

Hybrid I/O Automata Revisited.
Proceedings of the Hybrid Systems: Computation and Control, 4th International Workshop, 2001

Minimum-Cost Reachability for Priced Timed Automata.
Proceedings of the Hybrid Systems: Computation and Control, 4th International Workshop, 2001

2000
Verification of a Leader Election Protocol: Formal Methods Applied to IEEE 1394.
Formal Methods Syst. Des., 2000

Distributing Timed Model Checking - How the Search Order Matters.
Proceedings of the Computer Aided Verification, 12th International Conference, 2000

1999
Verification of Hybrid Systems (abstract).
Proceedings of the Formal Methods for Real-Time and Probabilistic Systems, 1999

Root Contention in IEEE 1394.
Proceedings of the Formal Methods for Real-Time and Probabilistic Systems, 1999

1998
Operational and Logical Semantics for Polling Real-Time Systems.
Proceedings of the Formal Techniques in Real-Time and Fault-Tolerant Systems, 1998

Normed Simulations.
Proceedings of the Computer Aided Verification, 10th International Conference, 1998

1997
The Difference between Splitting in n and n+1.
Inf. Comput., 1997

A Theory of Testing for Timed Automata (Abstract).
Proceedings of the TAPSOFT'97: Theory and Practice of Software Development, 1997

1996
A Note on Fairness in I/O Automata.
Inf. Process. Lett., 1996

Forward and Backward Simulations, II: Timing-Based Systems.
Inf. Comput., 1996

Action Transducers and Timed Automata.
Formal Aspects Comput., 1996

Minimizable Timed Automata.
Proceedings of the Formal Techniques in Real-Time and Fault-Tolerant Systems, 1996

Introduction.
Proceedings of the Lectures on Embedded Systems, European Educational Forum, 1996

1995
Forward and Backward Simulations: I. Untimed Systems
Inf. Comput., September, 1995

Three Logics for Branching Bisimulation.
J. ACM, 1995

Hybrid I/O Automata.
Proceedings of the Hybrid Systems III: Verification and Control, 1995

Verification of a Distributed Summation Algorithm.
Proceedings of the CONCUR '95: Concurrency Theory, 1995

1994
Turning SOS Rules into Equations
Inf. Comput., May, 1994

Verification of an Audio Control Protocol.
Proceedings of the Formal Techniques in Real-Time and Fault-Tolerant Systems, Third International Symposium Organized Jointly with the Working Group Provably Correct Systems, 1994

1993
Proof-Checking a Data Link Protocol.
Proceedings of the Types for Proofs and Programs, 1993

1992
Structured Operational Semantics and Bisimulation as a Congruence
Inf. Comput., October, 1992

An Algebra for Process Creation.
Acta Informatica, 1992

Expressive Results for Process Algebras.
Proceedings of the Sematics: Foundations and Applications, 1992

1991
Determinism - (Event Structure Isomorphism = Step Sequence Equivalence).
Theor. Comput. Sci., 1991

Forward and Backward Simulations for Timing-Based Systems.
Proceedings of the Real-Time: Theory in Practice, 1991

On the Relationship Between Process Algebra and Input/Output Automata
Proceedings of the Sixth Annual Symposium on Logic in Computer Science (LICS '91), 1991

1990
Modular specification of process algebras
Forschungsberichte, TU Munich, 1990

Action versus State based Logics for Transition Systems.
Proceedings of the Semantics of Systems of Concurrent Processes, 1990

Three Logics for Branching Bisimulation (Extended Abstract)
Proceedings of the Fourth Annual Symposium on Logic in Computer Science (LICS '89), 1990

An Efficient Algorithm for Branching Bisimulation and Stuttering Equivalence.
Proceedings of the Automata, Languages and Programming, 17th International Colloquium, 1990

Back and Forth Bisimulations.
Proceedings of the CONCUR '90, 1990

1989
Structural Operational Semantics and Bisimulation as a Congruence (Extended Abstract).
Proceedings of the Automata, Languages and Programming, 16th International Colloquium, 1989

1987
Petri Net Models for Algebraic Theories of Concurrency.
Proceedings of the PARLE, 1987

Modular Specifications in Process Algebra with Curious Queues.
Proceedings of the Algebraic Methods: Theory, 1987


  Loading...