Pages that link to "Item:Q707597"

The following pages link to Reachability results for timed automata with unbounded data structures (Q707597):

Displaying 2 items.

• Weak bisimulation for probabilistic timed automata (Q606996) (← links)
• A rewriting framework and logic for activities subject to regulations (Q2973251) (← links)