The following pages link to Salvatore La Torre (Q386610):
Displaying 50 items.
- Automata-theoretic decision of timed games (Q386611) (← links)
- Parametric metric interval temporal logic (Q483304) (← links)
- Visibly pushdown modular games (Q515657) (← links)
- Optimal paths in weighted timed automata (Q596026) (← links)
- Verification of well-formed communicating recursive state machines (Q944388) (← links)
- Verification of scope-dependent hierarchical state machines (Q948087) (← links)
- Deterministic finite automata with recursive calls and DPDAs (Q1014418) (← links)
- Decision problems for lower/upper bound parametric timed automata (Q1041291) (← links)
- Finite automata on timed \(\omega\)-trees (Q1395427) (← links)
- Timed tree automata with an application to temporal logic. (Q1608932) (← links)
- Weak Muller acceptance conditions for tree automata (Q1770388) (← links)
- Polyhedral flows in hybrid automata (Q1878924) (← links)
- Reachability of scope-bounded multistack pushdown systems (Q2216111) (← links)
- Modular strategies for recursive game graphs (Q2368953) (← links)
- The word problem for visibly pushdown languages described by grammars (Q2461562) (← links)
- A compositional approach to synchronize two-dimensional networks of processors (Q2729630) (← links)
- A General Modular Synthesis Problem for Pushdown Systems (Q2796073) (← links)
- A Temporal Logic for Multi-threaded Programs (Q2915173) (← links)
- A Unifying Approach for Multistack Pushdown Automata (Q2922031) (← links)
- Scope-bounded multistack pushdown systems: fixed-point, sequentialization, and tree-width (Q2957490) (← links)
- Reachability of Multistack Pushdown Systems with Scope-Bounded Matching Relations (Q3090831) (← links)
- Different time solutions for the firing squad synchronization problem on basic grid networks (Q3431435) (← links)
- THE FIRING SQUAD SYNCHRONIZATION PROBLEM ON SQUARES, TORUSES AND RINGS (Q3444850) (← links)
- On the Membership Problem for Visibly Pushdown Languages (Q3522902) (← links)
- An Infinite Automaton Characterization of Double Exponential Time (Q3540169) (← links)
- Parametric temporal logic for “model measuring” (Q3549124) (← links)
- The Language Theory of Bounded Context-Switching (Q3557012) (← links)
- Parametric Metric Interval Temporal Logic (Q3564866) (← links)
- Reducing Context-Bounded Concurrent Reachability to Sequential Reachability (Q3636878) (← links)
- (Q3842794) (← links)
- (Q4218131) (← links)
- (Q4249560) (← links)
- Automata-based Representations for Infinite Graphs (Q4331049) (← links)
- (Q4417938) (← links)
- Hierarchical and recursive state machines with context-dependent properties (Q4449219) (← links)
- (Q4472440) (← links)
- (Q4530005) (← links)
- (Q4552456) (← links)
- (Q4736990) (← links)
- (Q4737000) (← links)
- Synchronization of one-way connected processors (Q4794305) (← links)
- (Q4890704) (← links)
- (Q4938622) (← links)
- (Q4995374) (← links)
- Synchronization of 1-way connected processors (Q5055943) (← links)
- Modular Synthesis with Open Components (Q5168516) (← links)
- Deterministic generators and games for Ltl fragments (Q5277690) (← links)
- Safety of Parametrized Asynchronous Shared-Memory Systems is Almost Always Decidable (Q5357695) (← links)
- Decision Problems for Lower/Upper Bound Parametric Timed Automata (Q5428870) (← links)
- On the Complexity of Ltl Model-Checking of Recursive State Machines (Q5428871) (← links)
