10 Commits

Author	SHA1	Message	Date
bringert	160c6354c0	Towards smaller SRGs when lots of variants are used.	2006-12-15 16:09:58 +00:00
bringert	ededda152b	Generate monolithic FAs by expanding an MFA.	2006-01-05 20:35:22 +00:00
bringert	af905434a2	Remove unused sub-networks when generating multiple FAs.	2006-01-05 17:46:30 +00:00
bringert	6958b7bb7b	Remove more unneccessary nodes in SLF networks.	2006-01-05 16:48:55 +00:00
bringert	0603e75a14	Refactored Graph module. Remove some unneccessary states in slf networks.	2006-01-05 16:35:04 +00:00
bringert	79d771ab1d	Fintie state networks: fixed stack overflow problem with strictness in Graph and FiniteState. Some clean-up and smaller performance fixes.	2005-12-29 20:24:34 +00:00
bringert	9981704c5f	Finite state network generation: reimplemented getOutgoing using Data.Map to improve performance of minimize with large networks.	2005-12-29 13:33:58 +00:00
bringert	5c12a73dae	Some performance improvements in the FA generation.	2005-12-22 23:16:15 +00:00
bringert	09a705d192	Prepared for generation of finite automata in C.	2005-11-10 15:43:44 +00:00
bringert	b7609f09a5	Moved Graph and Relation stuff to separate modules. Added some QuickCheck properties for Relation. Improved relation datastructure and algorithms, making FA generation much faster.	2005-10-26 16:13:13 +00:00