On the complexity of monitoring Orchids signatures, and recurrence equations (Q1667643): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Closed-form upper bounds in static cost analysis / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Monitoring Metric First-Order Temporal Properties / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3549563 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Resource Analysis of Complex Programs with Cost Equations / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Computer Aided Verification / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Depth-First Search and Linear Graph Algorithms / rank | |||
Normal rank |
Latest revision as of 11:59, 16 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On the complexity of monitoring Orchids signatures, and recurrence equations |
scientific article |
Statements
On the complexity of monitoring Orchids signatures, and recurrence equations (English)
0 references
30 August 2018
0 references
monitor
0 references
complexity
0 references
recurrence equations
0 references
strongly connected components
0 references
Tarjan's algorithm
0 references