The language preservation problem is undecidable for parametric event-recording automata (Q1751409): Difference between revisions
From MaRDI portal
Changed an Item |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: A theory of timed automata / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Event-clock automata: a determinizable class of timed automata / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Parametric real-time reasoning / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: What’s Decidable About Parametric Timed Automata? / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Robust parametric reachability for timed automata / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Learning-Based Compositional Parameter Synthesis for Event-Recording Automata / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Language Preservation Problems in Parametric Timed Automata / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5590814 / rank | |||
Normal rank | |||
Revision as of 16:40, 15 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The language preservation problem is undecidable for parametric event-recording automata |
scientific article |
Statements
The language preservation problem is undecidable for parametric event-recording automata (English)
0 references
25 May 2018
0 references
formal methods
0 references
formal languages
0 references
parametric timed automata
0 references
event-recording automata
0 references
