Use alphanumeric identifiers or double-quoted strings for atomic propositions, and parentheses for grouping.
Identifiers cannot start with the letter of a prefix operator (F, G, or X): for instance GFa means G(F(a)). Use "GFa" if you really want to refer to GFa as a proposition.
Conversely, infix letter operators are not assumed to be operators if they are part of an identifier: aUb is an atomic proposition, unlike a U b and (a)U(b).

	Constants		Unary operators (prefix)		Binary operators (infix)
Boolean	false:	0 false	not:	! ~	and:	& && /\	implies:	-> --> =>
	true:	1 true			or:	| || + \/	equivalent:	<-> <--> <=>
					xor:	xor ^
LTL			eventually:	F <>	(strong) until:	U	weak until:	W
			always:	G []	(weak) release:	R V	strong release:	M
			next:	X ()
SERE	ε:	[*0]	Kleene star:	[*] [*i..j]	concatenation:	;	fusion:	:
			goto:	[->i..j]	intersection:	&& /\	NLM and:	&
			nonconsec. rep.:	[=i..j]	union:	| || + \/
PSL			weak closure:	{s}	∀-suffix impl.:	{s}[]->p {s}|->p {s}(p)	NO ∀-suffix impl.:	{s}[]=>p {s}|=>p
			strong closure:	{s}!	∃-suffix impl.:	{s}<>->p	NO ∃-suffix impl.:	{s}<>=>p

basic rewritings allow larger formulas
syntactic implication
eventuality and universality
language containment UTF-8 output

prune unaccepting SCCs
determinize and minimize obligation properties
direct simulation

Search accepting run using algorithm: Cou99 CVWY90 GV04 SE05 Tau03 Tau03_opt with these options: