The following pages link to Aniello Murano (Q329412):
Displaying 50 items.
- Checking interval properties of computations (Q329413) (← links)
- Ordered multi-stack visibly pushdown automata (Q344793) (← links)
- Automata-theoretic decision of timed games (Q386611) (← links)
- Improved model checking of hierarchical systems (Q418123) (← links)
- Exploring the boundary of half-positionality (Q656821) (← links)
- Quantitatively fair scheduling (Q764298) (← links)
- Verification of multi-agent systems with public actions against strategy logic (Q785241) (← links)
- Equilibria for games with combined qualitative and quantitative objectives (Q824280) (← links)
- Pushdown module checking (Q968362) (← links)
- Solving parity games: explicit vs symbolic (Q1616970) (← links)
- Practical verification of multi-agent systems against \textsc{Slk} specifications (Q1641030) (← links)
- Graded modalities in strategy logic (Q1641034) (← links)
- Event-clock nested automata (Q1647682) (← links)
- Reasoning about graded strategy quantifiers (Q1706169) (← links)
- Weak Muller acceptance conditions for tree automata (Q1770388) (← links)
- CTL\(^\ast\) with graded path modalities (Q1784942) (← links)
- Cycle detection in computation tree logic (Q1784962) (← links)
- Pushdown module checking with imperfect information (Q1951589) (← links)
- Alternating-time temporal logics with linear past (Q1989330) (← links)
- Improving parity games in practice (Q2043434) (← links)
- Context-free timed formalisms: robust automata and linear temporal logics (Q2113377) (← links)
- Verification of agent navigation in partially-known environments (Q2144175) (← links)
- Hierarchical cost-parity games (Q2210523) (← links)
- Model-checking graded computation-tree logic with finite path semantics (Q2285155) (← links)
- Natural strategic ability (Q2289013) (← links)
- On Promptness in Parity Games*† (Q2805469) (← links)
- Solving Parity Games Using an Automata-Based Algorithm (Q2830208) (← links)
- Prompt Interval Temporal Logic (Q2835872) (← links)
- On Promptness in Parity Games (Q2870156) (← links)
- (Q2908844) (← links)
- What Makes Atl* Decidable? A Decidable Fragment of Strategy Logic (Q2914371) (← links)
- A Behavioral Hierarchy of Strategy Logic (Q2921965) (← links)
- Graded computation tree logic (Q2946674) (← links)
- Reasoning About Strategies (Q2946746) (← links)
- Reasoning About Substructures and Games (Q2957764) (← links)
- Relentful strategic reasoning in alternating-time temporal logic (Q2957961) (← links)
- (Q2980973) (← links)
- Relentful Strategic Reasoning in Alternating-Time Temporal Logic (Q3066109) (← links)
- Balanced Paths in Colored Graphs (Q3182921) (← links)
- (Q3384177) (← links)
- (Q3456021) (← links)
- On CTL* with Graded Path Modalities (Q3460061) (← links)
- Enriched μ–Calculus Pushdown Module Checking (Q3498485) (← links)
- Pushdown Module Checking with Imperfect Information (Q3525655) (← links)
- Enriched MU-Calculi Module Checking (Q3535606) (← links)
- The Complexity of Enriched Mu-Calculi (Q3535618) (← links)
- Exploring the Boundary of Half Positionality (Q3582741) (← links)
- Graded Computation Tree Logic with Binary Coding (Q3586038) (← links)
- The Complexity of Enriched μ-Calculi (Q3591423) (← links)
- Branching-Time Temporal Logics with Minimal Model Quantifiers (Q3637242) (← links)
