Sciweavers

46 search results - page 5 / 10
» Strategical languages of infinite words
Sort
View
ICALP
2009
Springer
14 years 8 months ago
Weak Alternating Timed Automata
Alternating timed automata on infinite words are considered. The main result is a characterization of acceptance conditions for which the emptiness problem for the automata is deci...
Pawel Parys, Igor Walukiewicz
BIRTHDAY
2008
Springer
13 years 9 months ago
From Monadic Logic to PSL
One of the surprising developments in the area of program verification is how ideas introduced originally by logicians in the 1950s ended up yielding by 2003 an industrial-standard...
Moshe Y. Vardi
TCS
2008
13 years 7 months ago
Fine hierarchies and m-reducibilities in theoretical computer science
This is a survey of results about versions of fine hierarchies and many-one reducibilities that appear in different parts of theoretical computer science. These notions and relate...
Victor L. Selivanov
COLING
1992
13 years 8 months ago
The Proper Treatment Of Word Order In HPSG
: This paper describes a possibility of expressing ordering constraints among non-sister constituents in binary branching syntactic structures on a local basis, supported by viewin...
Karel Oliva
MIC
2003
128views Control Systems» more  MIC 2003»
13 years 9 months ago
A Discrete Event Simulation Package for Modular and Adaptive Assembly Plants
The paper deals with the discrete event simulation of a modular assembly plant for automotive derivation boxes. A simulation package has been developed in objectoriented language ...
Luca E. Bruzzone, Rezia M. Molfino, Matteo Zoppi