Sciweavers

227 search results - page 35 / 46
» Formal verification of systems with an unlimited number of c...
Sort
View
FDL
2011
IEEE
12 years 8 months ago
Integrating system descriptions by clocked guarded actions
—For the description of reactive systems, there is a large number of languages and formalisms, and depending on a particular application or design phase, one of them may be bette...
Jens Brandt, Mike Gemunde, Klaus Schneider, Sandee...
MAGS
2008
191views more  MAGS 2008»
13 years 8 months ago
Consensus ontologies in socially interacting MultiAgent systems
This paper presents approaches for building, managing, and evaluating consensus ontologies from the individual ontologies of a network of socially interacting agents. Each agent h...
Ergun Biçici
LDTA
2010
13 years 8 months ago
Faster ambiguity detection by grammar filtering
Real programming languages are often defined using ambiguous context-free grammars. Some ambiguity is intentional while other ambiguity is accidental. A good grammar development e...
H. J. S. Basten, Jurgen J. Vinju
TCS
2008
13 years 8 months ago
Nondeterministic polynomial time factoring in the tile assembly model
Formalized study of self-assembly has led to the definition of the tile assembly model, Previously I presented ways to compute arithmetic functions, such as addition and multiplic...
Yuriy Brun
FMCAD
2008
Springer
13 years 10 months ago
Automatic Non-Interference Lemmas for Parameterized Model Checking
Parameterized model checking refers to any method that extends traditional, finite-state model checking to handle systems arbitrary number of processes. One popular approach to thi...
Jesse D. Bingham