Sciweavers

36 search results - page 7 / 8
» concur 2009
Sort
View
CONCUR
2009
Springer
14 years 3 days ago
Model-Checking Games for Fixpoint Logics with Partial Order Models
Abstract. We introduce model-checking games that allow local secondorder power on sets of independent transitions in the underlying partial order models where the games are played....
Julian Gutierrez, Julian C. Bradfield
CONCUR
2009
Springer
14 years 3 days ago
Partial Order Reduction for Probabilistic Systems: A Revision for Distributed Schedulers
Abstract. The technique of partial order reduction (POR) for probabilistic model checking prunes the state space of the model so that a maximizing scheduler and a minimizing one pe...
Sergio Giro, Pedro R. D'Argenio, Luis María...
CONCUR
2009
Springer
14 years 3 days ago
Query-Based Model Checking of Ad Hoc Network Protocols
Abstract. A prominent source of complexity in the verification of ad hoc network (AHN) protocols is the fact that the number of network topologies grows exponentially with the squ...
Anu Singh, C. R. Ramakrishnan, Scott A. Smolka
CONCUR
2007
Springer
13 years 11 months ago
Solving Games Via Three-Valued Abstraction Refinement
Games via Three-Valued Abstraction Refinement Luca de Alfaro, Pritam Roy PII: S0890-5401(10)00018-0 DOI: 10.1016/j.ic.2009.05.007 Reference: YINCO 3711 To appear in: Information an...
Luca de Alfaro, Pritam Roy
CONCUR
2009
Springer
14 years 3 days ago
Probabilistic Weighted Automata
Nondeterministic weighted automata are finite automata with numerical weights on transitions. They define quantitative languages L that assign to each word w a real number L(w). ...
Krishnendu Chatterjee, Laurent Doyen, Thomas A. He...