Decidable verification for reducible timed automata specified in a first order logic with time (Q1606131): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(2 intermediate revisions by 2 users not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A theory of timed automata / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The benefits of relaxing punctuality / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3839068 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4934321 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A first order logic for specification of timed algorithms: Basic properties and a decidable class / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Complexity of deciding Tarski algebra / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4251919 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4938638 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4945224 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the computational complexity and geometry of the first-order theory of the reals. III: Quantifier elimination / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3221371 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4094390 / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Revision as of 12:16, 4 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Decidable verification for reducible timed automata specified in a first order logic with time |
scientific article |
Statements
Decidable verification for reducible timed automata specified in a first order logic with time (English)
0 references
31 July 2002
0 references
timed automata
0 references
verification
0 references
first-order logic
0 references
decidable class
0 references
0 references
0 references