
 check_complexity.h 
 helper class for time complexity checks during test runs


 coroutine.h 
 helper macros for coroutines


 counter_example.h 

 embedded_list.h 

 fixed_vector.h 
 a vector class that cannot be moved while it is not empty


 fsm_builder.h 
 The code in this file is used to construct an lts in fsm format.


 liblts_add_an_action_loop.h 

 liblts_bisim.h 

 liblts_bisim_dnj.h 
 O(m log n)time branching bisimulation algorithm.


 liblts_bisim_gj.h 
 O(m log n)time branching bisimulation algorithm similar to liblts_bisim_dnj.h which does not use bunches, i.e., partitions of transitions. This algorithm should be slightly faster, but in particular use less memory than liblts_bisim_dnj.h. Otherwise the functionality is exactly the same.


 liblts_bisim_gjkw.h 
 O(m log n)time stuttering equivalence algorithm.


 liblts_bisim_minimal_depth.h 

 liblts_branching_bisim_minimal_depth.h 

 liblts_coupledsim.h 

 liblts_failures_refinement.h 

 liblts_merge.h 

 liblts_pbisim_bem.h 

 liblts_pbisim_grv.h 

 liblts_plts_merge.h 

 liblts_ready_sim.h 
 Author(s): # Carlos GregorioRodriguez, Luis LLana, Rafael MartinezTorres.


 liblts_scc.h 

 liblts_sim.h 
 Header file for the simulation preorder algorithm.


 liblts_swap_to_from_probabilistic_lts.h 

 liblts_tau_star_reduce.h 

 liblts_weak_bisim.h 
 This file defines an algorithm for weak bisimulation, by calculating the transitive tau closure and apply strong bisimulation afterwards. In order to apply this algorithm it is advisable to first apply a branching bisimulation reduction.


 lts_convert.h 
 This file contains lts_convert routines that translate different lts formats into each other.


 lts_load.h 
 add your file description here.


 sim_hashtable.h 
 Header file for hash table data structure used by the simulation preorder algorithm.


 transition.h 

 tree_set.h 
