All Stories

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