Sciweavers

601 search results - page 19 / 121
» Model Checking CTL Properties of Pushdown Systems
Sort
View
FORMATS
2004
Springer
14 years 23 days ago
Lazy Approximation for Dense Real-Time Systems
We propose an effective and complete method for verifying safety and properties of timed systems, which is based on predicate abstraction for g finite abstractions of timed autom...
Maria Sorea
FSTTCS
2009
Springer
14 years 1 months ago
Covering of ordinals
The paper focuses on the structure of fundamental sequences of ordinals smaller than ε0. A first result is the construction of a monadic second-order formula identifying a given ...
Laurent Braud
CORR
2010
Springer
164views Education» more  CORR 2010»
13 years 4 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
FMICS
2008
Springer
13 years 9 months ago
Efficient Symbolic Model Checking for Process Algebras
Different approaches have been developed to mitigate the state space explosion of model checking techniques. Among them, symbolic verification techniques use efficient representati...
José Vander Meulen, Charles Pecheur
DALT
2010
Springer
13 years 2 months ago
Executing Specifications of Social Reasoning Agents
Social reasoning theories, whilst studied extensively in the area of multiagent systems, are hard to implement directly in agents. They often specify properties of beliefs or behav...
Iain Wallace, Michael Rovatsos