All Stories

  1. Common Foundations for SHACL, ShEx, and PG-Schema
  2. Priority Promotion with Parysian flair
  3. Solving mean-payoff games via quasi dominions
  4. Alternating (In)Dependence-Friendly Logic
  5. From Quasi-Dominions to Progress Measures
  6. Taming Strategy Logic: Non-Recurrent Fragments
  7. Quantifying Over Trees in Monadic Second-Order Logic
  8. Good-for-Game QPTL: An Alternating Hodges Semantics
  9. Satisfiability and containment of recursive SHACL
  10. Toward Usable Formal Models for Safety and Performance Evaluation of ERTMS/ETCS Level 3; The PERFORMINGRAIL Project
  11. Expressing Structural Temporal Properties of Safety Critical Hierarchical Systems
  12. Robust worst cases for parity games algorithms
  13. SHACL Satisfiability and Containment
  14. Solving Mean-Payoff Games via Quasi Dominions
  15. Satisfiability in Strategy Logic Can Be Easier than Model Checking
  16. Attacking Diophantus
  17. On the decidability of linear bounded periodic cyber-physical systems
  18. A delayed promotion policy for parity games
  19. Cycle detection in computation tree logic
  20. Practical verification of multi-agent systems against Slk specifications
  21. Reasoning about graded strategy quantifiers
  22. Solving parity games via priority promotion
  23. Robust Exponential Worst Cases for Divide-et-Impera Algorithms for Parity Games
  24. Reformulating Queries: Theory and Practice
  25. Herbrand property, finite quasi-Herbrand models, and a Chandra-Merlin theorem for quantified conjunctive queries
  26. Preface to the Special Issue on SR 2014
  27. Reasoning about Strategies: on the Satisfiability Problem
  28. A Delayed Promotion Policy for Parity Games
  29. Cycle Detection in Computation Tree Logic
  30. Improving Priority Promotion for Parity Games
  31. Solving Parity Games via Priority Promotion
  32. On the Counting of Strategies
  33. On Promptness in Parity Games*†
  34. Reasoning About Substructures and Games
  35. Special issue on SR 2013
  36. Relentful strategic reasoning in alternating-time temporal logic
  37. Reasoning About Strategies
  38. Synthesis of hierarchical systems
  39. MCMAS-SLK: A Model Checker for the Verification of Strategy Logic Specifications
  40. A Behavioral Hierarchy of Strategy Logic
  41. On the Boundary of Behavioral Strategies
  42. Substructure Temporal Logic
  43. On Promptness in Parity Games
  44. Graded computation tree logic
  45. Quantitatively fair scheduling
  46. Synthesis of Hierarchical Systems
  47. What Makes Atl* Decidable? A Decidable Fragment of Strategy Logic
  48. Exploring the boundary of half-positionality
  49. Exploring the Boundary of Half Positionality
  50. Graded Computation Tree Logic with Binary Coding
  51. Relentful Strategic Reasoning in Alternating-Time Temporal Logic
  52. Graded Computation Tree Logic
  53. Balanced Paths in Colored Graphs
  54. Branching-Time Temporal Logics with Minimal Model Quantifiers
  55. Comparing Rule-Based Policies