Sciweavers

309 search results - page 9 / 62
» Model Checking Games for Branching Time Logics
Sort
View
APLAS
2005
ACM
15 years 3 months ago
An Abstract Interpretation Perspective on Linear vs. Branching Time
act Interpretation Perspective on Linear vs. Branching Time Francesco Ranzato and Francesco Tapparo Dipartimento di Matematica Pura ed Applicata, Universit`a di Padova, Italy It is...
Francesco Ranzato, Francesco Tapparo
ATAL
2009
Springer
15 years 4 months ago
Abstraction in model checking multi-agent systems
ion in model checking multi-agent systems Mika Cohen Department of Computing Imperial College London London, UK Mads Dam Access Linnaeus Center Royal Institute of Technology Stockh...
Mika Cohen, Mads Dam, Alessio Lomuscio, Francesco ...
ATVA
2009
Springer
173views Hardware» more  ATVA 2009»
15 years 4 months ago
Solving Parity Games in Practice
Parity games are 2-player games of perfect information and infinite duration that have important applications in automata theory and decision procedures (validity as well as model...
Oliver Friedmann, Martin Lange
ENTCS
2008
101views more  ENTCS 2008»
14 years 9 months ago
Model Checking Quantitative Linear Time Logic
This paper considers QLtl, a quantitative analagon of Ltl and presents algorithms for model checking QLtl over quantitative versions of Kripke structures and Markov chains.
Marco Faella, Axel Legay, Mariëlle Stoelinga