Sciweavers

1202 search results - page 70 / 241
» Sortings for Reactive Systems
Sort
View
CADE
2007
Springer
16 years 6 months ago
Combination Methods for Satisfiability and Model-Checking of Infinite-State Systems
Manna and Pnueli have extensively shown how a mixture of first-order logic (FOL) and discrete Linear time Temporal Logic (LTL) is sufficient to precisely state verification problem...
Silvio Ghilardi, Enrica Nicolini, Silvio Ranise, D...
ICFP
2001
ACM
16 years 6 months ago
Developing a Stage Lighting System from Scratch
Lula is a system for computer-assisted stage lighting design and control. Whereas other systems for the same purpose are usually the results of long chains of incremental improvem...
Michael Sperber
FDL
2011
IEEE
14 years 5 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...
NFM
2011
306views Formal Methods» more  NFM 2011»
15 years 1 months ago
Generalized Rabin(1) Synthesis with Applications to Robust System Synthesis
Synthesis of finite-state machines from linear-time temporal logic (LTL) formulas is an important formal specification debugging technique for reactive systems and can quickly ge...
Rüdiger Ehlers
FOSSACS
2007
Springer
16 years 9 days ago
Logical Characterizations of Bisimulations for Discrete Probabilistic Systems
We give logical characterizations of bisimulation relations for the probabilistic automata of Segala in terms of three Hennessy-Milner style logics. The three logics characterize s...
Augusto Parma, Roberto Segala