Translator of LTL to Transition-based Generalized Büchi Automata

LTL (or PSL) Formula to translateFold

Send

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		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:	\| \|\| + \/
			iterated fusion:	[:] [:+] [:i..j]
PSL			weak closure:	{s}	triggers:	{s}[]->p {s}\|->p {s}(p)	Non-Ov. trigger:	{s}[]=>p {s}\|=>p
PSL			strong closure:	{s}!	seq:	{s}<>->p	Non-Ov. seq:	{s}<>=>p

Formula SimplificationsFold

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

Automaton SimplificationsFold

prune unaccepting SCCs
determinize and minimize obligation properties
direct simulation reverse simulation iterated simulations

Emptiness-check AlgorithmFold

Search accepting run using algorithm: with these options:

Testing Automaton OptionsFold