Works matching IS 01290541 AND DT 2011 AND VI 22 AND IP 4
Results: 13
AUTOMATIC VERIFICATION OF DIRECTORY-BASED CONSISTENCY PROTOCOLS WITH GRAPH CONSTRAINTS.
- Published in:
- International Journal of Foundations of Computer Science, 2011, v. 22, n. 4, p. 761, doi. 10.1142/S0129054111008416
- By:
- Publication type:
- Article
PREFACE.
- Published in:
- International Journal of Foundations of Computer Science, 2011, v. 22, n. 4, p. 757, doi. 10.1142/S0129054111008404
- By:
- Publication type:
- Article
ON YEN'S PATH LOGIC FOR PETRI NETS.
- Published in:
- International Journal of Foundations of Computer Science, 2011, v. 22, n. 4, p. 783, doi. 10.1142/S0129054111008428
- By:
- Publication type:
- Article
COMPUTABLE SEMANTICS FOR CTL* ON DISCRETE-TIME AND CONTINUOUS-SPACE DYNAMIC SYSTEMS.
- Published in:
- International Journal of Foundations of Computer Science, 2011, v. 22, n. 4, p. 801, doi. 10.1142/S012905411100843X
- By:
- Publication type:
- Article
FORMALISMS FOR SPECIFYING MARKOVIAN POPULATION MODELS.
- Published in:
- International Journal of Foundations of Computer Science, 2011, v. 22, n. 4, p. 823, doi. 10.1142/S0129054111008441
- By:
- Publication type:
- Article
FORWARD ANALYSIS OF DYNAMIC NETWORK OF PUSHDOWN SYSTEMS IS EASIER WITHOUT ORDER.
- Published in:
- International Journal of Foundations of Computer Science, 2011, v. 22, n. 4, p. 843, doi. 10.1142/S0129054111008453
- By:
- Publication type:
- Article
CLASS COUNTING AUTOMATA ON DATAWORDS.
- Published in:
- International Journal of Foundations of Computer Science, 2011, v. 22, n. 4, p. 863, doi. 10.1142/S0129054111008465
- By:
- Publication type:
- Article
GENERAL ALGORITHMS FOR TESTING THE AMBIGUITY OF FINITE AUTOMATA AND THE DOUBLE-TAPE AMBIGUITY OF FINITE-STATE TRANSDUCERS.
- Published in:
- International Journal of Foundations of Computer Science, 2011, v. 22, n. 4, p. 883, doi. 10.1142/S0129054111008477
- By:
- Publication type:
- Article
AVOIDING ABELIAN POWERS IN BINARY WORDS WITH BOUNDED ABELIAN COMPLEXITY.
- Published in:
- International Journal of Foundations of Computer Science, 2011, v. 22, n. 4, p. 905, doi. 10.1142/S0129054111008489
- By:
- Publication type:
- Article
WEIGHTED AUTOMATA FOR FULL-TEXT INDEXING.
- Published in:
- International Journal of Foundations of Computer Science, 2011, v. 22, n. 4, p. 921, doi. 10.1142/S0129054111008490
- By:
- Publication type:
- Article
STRONGER QUICKHEAPS.
- Published in:
- International Journal of Foundations of Computer Science, 2011, v. 22, n. 4, p. 945, doi. 10.1142/S0129054111008507
- By:
- Publication type:
- Article
WORST-CASE PERFORMANCE EVALUATION ON MULTIPROCESSOR TASK SCHEDULING WITH RESOURCE AUGMENTATION.
- Published in:
- International Journal of Foundations of Computer Science, 2011, v. 22, n. 4, p. 971, doi. 10.1142/S0129054111008519
- By:
- Publication type:
- Article
MEASURING THE QUALITY OF SURVEILLANCE IN A WIRELESS SENSOR NETWORK.
- Published in:
- International Journal of Foundations of Computer Science, 2011, v. 22, n. 4, p. 983, doi. 10.1142/S0129054111008520
- By:
- Publication type:
- Article