Pages that link to "Item:Q557828"
From MaRDI portal
The following pages link to On the completeness and decidability of duration calculus with iteration (Q557828):
Displaying 8 items.
- A generalization of Arrow's lemma on extending a binary relation (Q2330278) (← links)
- A survey on temporal logics for specifying and verifying real-time systems (Q2418645) (← links)
- Automata for a decidable subset of duration calculus. (Q2737553) (← links)
- Prefix and projection onto state in duration calculus (Q2842576) (← links)
- Sharpening the incompleteness of the duration calculus (Q2851075) (← links)
- Decidability of a hybrid duration calculus (Q2867952) (← links)
- A Relatively Complete Axiomatisation of Projection onto State in the Duration Calculus (Q3643269) (← links)
- Take It NP-Easy: Bounded Model Construction for Duration Calculus (Q5392294) (← links)