Pages that link to "Item:Q4686606"

The following pages link to What’s Decidable About Parametric Timed Automata? (Q4686606):

Displaying 2 items.

• The language preservation problem is undecidable for parametric event-recording automata (Q1751409) (← links)
• Iterative bounded synthesis for efficient cycle detection in parametric timed automata (Q2044207) (← links)