The language preservation problem is undecidable for parametric event-recording automata (Q1751409): Difference between revisions
From MaRDI portal
Created a new Item |
Normalize DOI. |
||
(6 intermediate revisions by 6 users not shown) | |||
Property / DOI | |||
Property / DOI: 10.1016/j.ipl.2018.03.013 / rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2790850524 / rank | |||
Normal rank | |||
Property / arXiv ID | |||
Property / arXiv ID: 1812.08948 / rank | |||
Normal rank | |||
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 | |||
Property / Wikidata QID | |||
Property / Wikidata QID: Q130085686 / rank | |||
Normal rank | |||
Property / DOI | |||
Property / DOI: 10.1016/J.IPL.2018.03.013 / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 08:12, 11 December 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