Sciweavers

12981 search results - page 117 / 2597
» Model Checking (Abstract)
Sort
View
150
Voted
IPL
2008
110views more  IPL 2008»
15 years 2 months ago
Reduction of stochastic parity to stochastic mean-payoff games
Abstract. A stochastic graph game is played by two players on a game graph with probabilistic transitions. We consider stochastic graph games with -regular winning conditions speci...
Krishnendu Chatterjee, Thomas A. Henzinger
124
Voted
CAV
2010
Springer
168views Hardware» more  CAV 2010»
15 years 25 days ago
A Dash of Fairness for Compositional Reasoning
Abstract. Proofs of progress properties often require fairness assumptions. Incorporating global fairness assumptions in a compositional method is a challenge, however, given the l...
Ariel Cohen 0002, Kedar S. Namjoshi, Yaniv Sa'ar
109
Voted
CORR
2010
Springer
164views Education» more  CORR 2010»
14 years 11 months ago
Precedence Automata and Languages
Abstract. Operator precedence grammars define a classical Boolean and deterministic context-free family (called Floyd languages or FLs). FLs have been shown to strictly include the...
Violetta Lonati, Dino Mandrioli, Matteo Pradella
118
Voted
CONCUR
2001
Springer
15 years 7 months ago
On the Power of Labels in Transition Systems
Abstract. In this paper we discuss the role of labels in transition systems with regard to bisimilarity and model checking problems. We suggest a general reduction from labelled tr...
Jirí Srba
BIRTHDAY
2008
Springer
15 years 4 months ago
Some Results on the Expressive Power and Complexity of LSCs
Abstract. We survey some of the main results regarding the complexity and expressive power of Live Sequence Charts (LSCs). We first describe the two main semantics given to LSCs: a...
David Harel, Shahar Maoz, Itai Segall