Jan Friso Groote

Orcid: 0000-0003-2196-6587

Affiliations:
  • Eindhoven University of Technology, The Netherlands


According to our database1, Jan Friso Groote authored at least 165 papers between 1989 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Formal Methods for Industrial Critical Systems.
Int. J. Softw. Tools Technol. Transf., April, 2024

Formally Modelling the Rijkswaterstaat Tunnel Control Systems in a Constrained Industrial Environment.
Proceedings of the Proceedings Sixth Workshop on Models for Formal Analysis of Real Systems, 2024

Minimal Depth Distinguishing Formulas Without Until for Branching Bisimulation.
Proceedings of the Logics and Type Systems in Theory and Practice, 2024

2023
Linear parallel algorithms to compute strong and branching bisimilarity.
Softw. Syst. Model., April, 2023

Innermost many-sorted term rewriting on GPUs.
Sci. Comput. Program., 2023

Lowerbounds for Bisimulation by Partition Refinement.
Log. Methods Comput. Sci., 2023

A Cancellation Law for Probabilistic Processes.
Proceedings of the Proceedings Combined 30th International Workshop on Expressiveness in Concurrency and 20th Workshop on Structural Operational Semantics, 2023

Real Equation Systems with Alternating Fixed-points (full version with proofs).
CoRR, 2023

Tool interoperability for model-based systems engineering.
CoRR, 2023

A formal analysis of Dutch Generic Integral Tunnel Design models.
Proceedings of the 38th ACM/SIGAPP Symposium on Applied Computing, 2023

An Autonomous Data Language.
Proceedings of the Theoretical Aspects of Computing - ICTAC 2023, 2023

Compositional Learning for Interleaving Parallel Automata.
Proceedings of the Foundations of Software Science and Computation Structures, 2023

Minimisation of Spatial Models Using Branching Bisimilarity.
Proceedings of the Formal Methods - 25th International Symposium, 2023

Real Equation Systems with Alternating Fixed-Points.
Proceedings of the 34th International Conference on Concurrency Theory, 2023

Computing Minimal Distinguishing Hennessy-Milner Formulas is NP-Hard, but Variants are Tractable.
Proceedings of the 34th International Conference on Concurrency Theory, 2023

Understanding Behaviour of Distributed Systems Using mCRL2, 1
458, Springer, ISBN: 978-3-031-23007-3, 2023

2022
A Thread-Safe Term Library - (with a New Fast Mutual Exclusion Protocol).
Proceedings of the Leveraging Applications of Formal Methods, Verification and Validation. Verification Principles, 2022

Constructive Model Inference: Model Learning for Component-based Software Architectures.
Proceedings of the 17th International Conference on Software Technologies, 2022

Using the Parallel ATerm Library for Parallel Model Checking and State Space Generation.
Proceedings of the A Journey from Process Algebra via Timed Automata to Model Learning, 2022

2021
Correct and Efficient Antichain Algorithms for Refinement Checking.
Log. Methods Comput. Sci., 2021

A thread-safe Term Library.
CoRR, 2021

Fair Mutual Exclusion for N Processes (extended version).
CoRR, 2021

Infinite Choice and Probability Distributions. An Open Problem: The Real Hotel.
Proceedings of the Proceedings Combined 28th International Workshop on Expressiveness in Concurrency and 18th Workshop on Structural Operational Semantics, 2021

A Set Automaton to Locate All Pattern Matches in a Term.
Proceedings of the Theoretical Aspects of Computing - ICTAC 2021, 2021

Term Rewriting on GPUs.
Proceedings of the Fundamentals of Software Engineering - 9th International Conference, 2021

Tutorial: Designing Distributed Software in mCRL2.
Proceedings of the Formal Techniques for Distributed Objects, Components, and Systems, 2021

A Linear Parallel Algorithm to Compute Bisimulation and Relational Coarsest Partitions.
Proceedings of the Formal Aspects of Component Software - 17th International Conference, 2021

Bisimulation by Partitioning Is Ω((m+n)log n).
Proceedings of the 32nd International Conference on Concurrency Theory, 2021

Logic Gates, Circuits, Processors, Compilers and Computers
Springer, ISBN: 978-3-030-68552-2, 2021

2020
Finding compact proofs for infinite-data parameterised Boolean equation systems.
Sci. Comput. Program., 2020

A symmetric protocol to establish service level agreements.
Log. Methods Comput. Sci., 2020

A Complete Axiomatisation for Probabilistic Trace Equivalence.
Sci. Ann. Comput. Sci., 2020

A Formally Verified Fail-Operational Safety Concept for Automated Driving.
CoRR, 2020

An O(m log n) algorithm for branching bisimilarity on labelled transition systems.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2020

Beyond SOTIF: Black Swans and Formal Methods.
Proceedings of the IEEE International Systems Conference, 2020

Active Learning of Decomposable Systems.
Proceedings of the FormaliSE@ICSE 2020: 8th International Conference on Formal Methods in Software Engineering, 2020

A Near-Linear-Time Algorithm for Weak Bisimilarity on Markov Chains.
Proceedings of the 31st International Conference on Concurrency Theory, 2020

2019
Verification of hypertorus communication grids by infinite petri nets and process algebra.
IEEE CAA J. Autom. Sinica, 2019

A simpler O(m log n) algorithm for branching bisimilarity on labelled transition systems.
CoRR, 2019

Distribution of Behaviour into Parallel Communicating Subsystems.
Proceedings of the Proceedings Combined 26th International Workshop on Expressiveness in Concurrency and 16th Workshop on Structural Operational Semantics, 2019

The mCRL2 Toolset for Analysing Concurrent Systems - Improvements in Expressivity and Usability.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2019

Active Learning of Industrial Software with Data.
Proceedings of the Fundamentals of Software Engineering - 8th International Conference, 2019

Verifying System-Wide Properties of Industrial Component-Based Software.
Proceedings of the Fundamentals of Software Engineering - 8th International Conference, 2019

Modelling and Analysing Software in mCRL2.
Proceedings of the Formal Aspects of Component Software - 16th International Conference, 2019

An Axiomatization of Strong Distribution Bisimulation for a Language with a Parallel Operator and Probabilistic Choice.
Proceedings of the From Software Engineering to Formal Methods and Tools, and Back, 2019

A Complete Axiomatization of Branching Bisimilarity for a Simple Process Language with Probabilistic Choice - (Extended Abstract).
Proceedings of the Art of Modelling Computational Systems: A Journey from Logic and Concurrency to Security and Privacy, 2019

2018
An Efficient Algorithm to Determine Probabilistic Bisimulation.
Algorithms, 2018

Pitfalls in Applying Model Learning to Industrial Legacy Software.
Proceedings of the Leveraging Applications of Formal Methods, Verification and Validation. Industrial Practice, 2018

Solving Parameterised Boolean Equation Systems with Infinite Data Through Quotienting.
Proceedings of the Formal Aspects of Component Software - 15th International Conference, 2018

2017
An <i>O</i>(<i>m</i>log<i>n</i>) Algorithm for Computing Stuttering Equivalence and Branching Bisimulation.
ACM Trans. Comput. Log., 2017

Modelling and Verification of a Cluster-tree Formation Protocol Implementation for the IEEE 802.15.4 TSCH MAC Operation Mode.
Proceedings of the Proceedings 2nd Workshop on Models for Formal Analysis of Real Systems, 2017

Assessing the Quality of Tabular State Machines through Metrics.
Proceedings of the 2017 IEEE International Conference on Software Quality, 2017

Formalising the Dezyne Modelling Language in mCRL2.
Proceedings of the Critical Systems: Formal Methods and Automated Verification - Joint 22nd International Workshop on Formal Methods for Industrial Critical Systems - and, 2017

Problem Solving Using Process Algebra Considered Insightful.
Proceedings of the ModelEd, TestEd, TrustEd, 2017

The Mean Drift: Tailoring the Mean Field Theory of Markov Processes for Real-World Applications.
Proceedings of the Analytical and Stochastic Modelling Techniques and Applications, 2017

2016
Evaluating the effect of a lightweight formal technique in industry.
Int. J. Softw. Tools Technol. Transf., 2016

A Probabilistic Analysis of the Game of the Goose.
SIAM Rev., 2016

An O(m\log n) Algorithm for Stuttering Equivalence and Branching Bisimulation.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2016

Software that Meets Its Intent.
Proceedings of the Leveraging Applications of Formal Methods, Verification and Validation: Discussion, Dissemination, Applications, 2016

2015
Specification guidelines to avoid the state space explosion problem.
Softw. Test. Verification Reliab., 2015

Software engineering: Redundancy is key.
Sci. Comput. Program., 2015

Communication Patterns in Mean Field Models for Wireless Sensor Networks.
CoRR, 2015

Exact Real Arithmetic with Perturbation Analysis and Proof of Correctness.
CoRR, 2015

Continuous approximation of stochastic models for wireless sensor networks.
Proceedings of the 2015 IEEE Symposium on Communications and Vehicular Technology in the Benelux, 2015

2014
Redundancy in the Software Design Process is Essential for Designing Correct Software.
ERCIM News, 2014

On the Random Structure of Behavioural Transition Systems.
Electron. Commun. Eur. Assoc. Softw. Sci. Technol., 2014

Book Announcement: Modeling and Analysis of Communicating Systems.
Bull. EATCS, 2014

Modeling and Analysis of Communicating Systems.
MIT Press, ISBN: 9780262321020, 2014

2013
An Overview of the mCRL2 Toolset and Its Recent Advances.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2013

Analysis of Path Planning Algorithms: a Formal Verification-based Approach.
Proceedings of the Twelfth European Conference on the Synthesis and Simulation of Living Systems: Advances in Artificial Life, 2013

2012
Advances in Model Driven Software Engineering.
ERCIM News, 2012

Dogfooding the Formal Semantics of mCRL2.
Proceedings of the 35th Annual IEEE Software Engineering Workshop, 2012

Experience report on developing the Front-end client unit under the control of formal methods.
Proceedings of the ACM Symposium on Applied Computing, 2012

Analyzing a Controller of a Power Distribution Unit Using Formal Methods.
Proceedings of the Fifth IEEE International Conference on Software Testing, 2012

Experience Report on Designing and Developing Control Components Using Formal Methods.
Proceedings of the FM 2012: Formal Methods, 2012

2011
A linear translation from CTL* to the first-order modal μ -calculus.
Theor. Comput. Sci., 2011

Experiences in developing the mCRL2 toolset.
Softw. Pract. Exp., 2011

Generation and Evaluation of Business Continuity Processes using Algebraic Graph Transformation and the mCRL2 Process Algebra.
J. Res. Pract. Inf. Technol., 2011

Analyzing the effects of formal methods on the development of industrial control software.
Proceedings of the IEEE 27th International Conference on Software Maintenance, 2011

2009
Search algorithms for automated validation.
J. Log. Algebraic Methods Program., 2009

Suitability of mCRL2 for Concurrent-System Design: A 2 × 2 Switch Case Study.
Proceedings of the Formal Methods for Components and Objects - 8th International Symposium, 2009

The 3TU embedded systems master in the Netherlands.
Proceedings of the 2009 Workshop on Embedded Systems Education, 2009

2008
Switching Graphs.
Proceedings of the Second Workshop on Reachability Problems in Computational Models, 2008

Statistical Certification of Software Systems.
Commun. Stat. Simul. Comput., 2008

Verification of networks of timed automata using mCRL2.
Proceedings of the 22nd IEEE International Symposium on Parallel and Distributed Processing, 2008

Parameterised Anonymity.
Proceedings of the Formal Aspects in Security and Trust, 5th International Workshop, 2008

2007
SOS formats and meta-theory: 20 years after.
Theor. Comput. Sci., 2007

Operational semantics for Petri net components.
Theor. Comput. Sci., 2007

Lock-free parallel and concurrent garbage collection by mark&sweep.
Sci. Comput. Program., 2007

Transformation of BPMN Models for Behaviour Analysis.
Proceedings of the Modelling, 2007

Sarir: A Rebeca to mCRL2 Translator.
Proceedings of the Seventh International Conference on Application of Concurrency to System Design (ACSD 2007), 2007

2006
Interactive visualization of large state spaces.
Int. J. Softw. Tools Technol. Transf., 2006

Time abstraction in timed μCRL a la regions.
Proceedings of the 20th International Parallel and Distributed Processing Symposium (IPDPS 2006), 2006

The Formal Specification Language mCRL2.
Proceedings of the Methods for Modelling Software Systems (MMOSS), 27.08. - 01.09.2006, 2006

2005
Parameterised boolean equation systems.
Theor. Comput. Sci., 2005

Model-checking processes with data.
Sci. Comput. Program., 2005

A syntactic commutativity format for SOS.
Inf. Process. Lett., 2005

Notions of bisimulation and congruence formats for SOS with data.
Inf. Comput., 2005

A computer checked algebraic verification of a distributed summation algorithm.
Formal Aspects Comput., 2005

Verification of a sliding window protocol in µCRL and PVS.
Formal Aspects Comput., 2005

Discretization of Timed Automata in Timed mu.
Proceedings of the Workshop "Essays on Algebraic Process Calculi", 2005

From µCRL to mCRL2: Motivation and Outline.
Proceedings of the Workshop "Essays on Algebraic Process Calculi", 2005

A Hierarchy of SOS Rule Formats.
Proceedings of the Second Workshop on Structural Operational Semantics, 2005

Lock-free dynamic hash tables with open addressing.
Distributed Comput., 2005

Exploring students' understanding of the concept of algorithm: levels of abstraction.
Proceedings of the 10th Annual SIGCSE Conference on Innovation and Technology in Computer Science Education, 2005

Lock-Free Parallel Garbage Collection.
Proceedings of the Parallel and Distributed Processing and Applications, 2005

A Sub-quadratic Algorithm for Conjunctive and Disjunctive Boolean Equation Systems.
Proceedings of the Theoretical Aspects of Computing, 2005

2004
Analysing the BKE-security Protocol with <i>µ</i>CRL.
Proceedings of the 6th AMAST Workshop on Real-Time Systems, 2004

Process Algebra Needs Proof Methodology (Columns: Concurrency).
Bull. EATCS, 2004

Solving Disjunctive/Conjunctive Boolean Equation Systems with Alternating Fixed Points.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2004

Congruence for SOS with Data.
Proceedings of the 19th IEEE Symposium on Logic in Computer Science (LICS 2004), 2004

Almost Wait-Free Resizable Hashtable.
Proceedings of the 18th International Parallel and Distributed Processing Symposium (IPDPS 2004), 2004

Parameterised Boolean Equation Systems (Extended Abstract).
Proceedings of the CONCUR 2004 - Concurrency Theory, 15th International Conference, London, UK, August 31, 2004

Verifying a Sliding Window Protocol in µCRL.
Proceedings of the Algebraic Methodology and Software Technology, 2004

2003
Task Allocation in a Multi-Server System.
J. Sched., 2003

Binary decision diagrams for first-order predicate logic.
J. Log. Algebraic Methods Program., 2003

Analysis of a distributed system for lifting trucks.
J. Log. Algebraic Methods Program., 2003

Transforming equality logic to propositional logic.
Proceedings of the 4th International Workshop on First-Order Theorem Proving, 2003

New developments around the mCRL tool set.
Proceedings of the Eighth International Workshop on Formal Methods for Industrial Critical Systems, 2003

Resolution and binary decision diagrams cannot simulate each other polynomially.
Discret. Appl. Math., 2003

Efficient almost wait-free parallel accessible dynamic hashtables
CoRR, 2003

Large State Space Visualization.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2003

A Checker for Modal Formulae for Processes with Data.
Proceedings of the Formal Methods for Components and Objects, 2003

2002
Computer assisted manipulation of algebraic process specifications.
ACM SIGPLAN Notices, 2002

Completeness of Timed mCRL.
Fundam. Informaticae, 2002

2001
The parallel composition of uniform processes with data.
Theor. Comput. Sci., 2001

Analysis of three hybrid systems in timed µCRL.
Sci. Comput. Program., 2001

Focus points and convergent process operators: a proof strategy for protocol verification.
J. Log. Algebraic Methods Program., 2001

Linearization in parallel pCRL.
J. Log. Algebraic Methods Program., 2001

Wait-free concurrent memory management by Create and Read until Deletion (CaRuD).
Distributed Comput., 2001

An algorithm for the asynchronous Write-All problem based on process collision.
Distributed Comput., 2001

µCRL: A Toolset for Analysing Algebraic Specifications.
Proceedings of the Computer Aided Verification, 13th International Conference, 2001

Algebraic Process Verification.
Proceedings of the Handbook of Process Algebra, 2001

2000
The Propositional Formula Checker HeerHugo.
J. Autom. Reason., 2000

State Space Reduction Using Partial tau-Confluence.
Proceedings of the Mathematical Foundations of Computer Science 2000, 2000

Equational Binary Decision Diagrams.
Proceedings of the Logic for Programming and Automated Reasoning, 2000

LARIS 1.0 - LAnguage for Railway Interlooking Specifications.
CWI, ISBN: 978-90-6196-489-6, 2000

1999
A Complete Equational Axiomatization for MPA with String Iteration.
Theor. Comput. Sci., 1999

The Vital Processor Interlocking.
Proceedings of the Algebraic Specification in Action, 1999

1998
Editorial.
Formal Aspects Comput., 1998

Checking Verifications of Protocols and Distributed Systems by Computer.
Proceedings of the CONCUR '98: Concurrency Theory, 1998

Verification of Temporal Properties of Processes in a Setting with Data.
Proceedings of the Algebraic Methodology and Software Technology, 1998

1997
Formal Verification of a Leader Election Protocol in Process Algebra.
Theor. Comput. Sci., 1997

Foreword.
Sci. Comput. Program., 1997

Formalizing Process Algebraic Verifications in the Calculus of Constructions.
Formal Aspects Comput., 1997

1996
Confluence for Process Verification.
Theor. Comput. Sci., 1996

The Meaning of Negative Premises in Transition System Specifications.
J. ACM, 1996

Hiding Propositional Constants in BDDs.
Formal Methods Syst. Des., 1996

Concurrency Theory Will Set Standards for Description and Analysis of Software.
ACM Comput. Surv., 1996

A Bounded Retransmission Protocol for Large Data Packets.
Proceedings of the Algebraic Methodology and Software Technology, 1996

1994
Undecidable Equivalences for Basic Process Algebra
Inf. Comput., December, 1994

Process Algebra with Guards: Combining Hoare Logic with Process Algebra.
Formal Aspects Comput., 1994

A Correctness Proof of a One-Bit Sliding Window Protocol in µCRL.
Comput. J., 1994

Invariants in Process Algebra with Data.
Proceedings of the CONCUR '94, 1994

1993
Transition System Specifications with Negative Premises.
Theor. Comput. Sci., 1993

Proof Theory for µCRL: A Language for Processes with Data.
Proceedings of the Semantics of Specification Languages (SoSL), 1993

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

A Short Proof of the Decidability of Bisimulation for Normed BPA-Processes.
Inf. Process. Lett., 1992

Verification of Parallel Systems via Decomposition.
Proceedings of the CONCUR '92, 1992

1991
Process Algebra with Guards - Combining Hoare Logic with Process Algebra (Extended Abstract).
Proceedings of the CONCUR '91, 1991

1990
Specification and verification of real time systems in ACP.
Proceedings of the Protocol Specification, 1990

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

Transition System Specifications with Negative Premises (Extended Abstract).
Proceedings of the CONCUR '90, 1990

A New Strategy for Proving omega-Completeness applied to Process Algebra.
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


  Loading...