The following pages link to Margherita Napoli (Q483303):
Displaying 48 items.
- Parametric metric interval temporal logic (Q483304) (← links)
- Verification of scope-dependent hierarchical state machines (Q948087) (← links)
- (Q1073018) (redirect page) (← links)
- Hierarchies of primitive recursive wordsequence functions: Comparisons and decision problems (Q1073019) (← links)
- C-tree systolic automata (Q1102750) (← links)
- Languages accepted by systolic \(Y\)-tree automata: Structural characterizations (Q1323359) (← links)
- Succinctness of descriptions of SBTA-languages (Q1391741) (← 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)
- Reachability of scope-bounded multistack pushdown systems (Q2216111) (← 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)
- On a logic for coalitional games with priced-resource agents (Q2825419) (← links)
- A Temporal Logic for Multi-threaded Programs (Q2915173) (← links)
- A Unifying Approach for Multistack Pushdown Automata (Q2922031) (← links)
- Minimum and non-Minimum Time Solutions to the Firing Squad Synchronization Problem (Q2944883) (← links)
- Reachability of Multistack Pushdown Systems with Scope-Bounded Matching Relations (Q3090831) (← links)
- Model Checking for Graded CTL (Q3400570) (← links)
- Different time solutions for the firing squad synchronization problem on basic grid networks (Q3431435) (← links)
- On the Membership Problem for Visibly Pushdown Languages (Q3522902) (← links)
- CTL Model-Checking with Graded Quantifiers (Q3540061) (← links)
- Parametric Metric Interval Temporal Logic (Q3564866) (← links)
- (Q3751039) (← links)
- A hierarchy of loop programs over binary trees (Q3802613) (← links)
- (Q3832052) (← links)
- Web structures: a tool for representing and manipulating programs (Q3833598) (← links)
- (Q3842794) (← links)
- (Q4218131) (← links)
- (Q4266540) (← links)
- Automata-based Representations for Infinite Graphs (Q4331049) (← links)
- (Q4348010) (← links)
- Hierarchical and recursive state machines with context-dependent properties (Q4449219) (← links)
- (Q4472440) (← links)
- (Q4530005) (← links)
- (Q4737000) (← links)
- Synchronization of one-way connected processors (Q4794305) (← links)
- Power of interconnections and of nondeterminism in regularY-tree systolic automata (Q4835866) (← links)
- (Q4864792) (← links)
- (Q4890704) (← links)
- Model checking coalitional games in shortage resource scenarios (Q4992519) (← links)
- Synchronization of 1-way connected processors (Q5055943) (← links)
- State complexity of SBTA languages (Q5096343) (← links)
- Program Complexity in Hierarchical Module Checking (Q5505563) (← links)
- Scope-bounded pushdown languages (Q5890814) (← links)
- Scope-Bounded Pushdown Languages (Q5891814) (← links)
- Graded Alternating-Time Temporal Logic (Q5894019) (← links)
- Graded Alternating-Time Temporal Logic (Q5894193) (← links)
