Sciweavers

1717 search results - page 175 / 344
» A Computable Spectral Theorem
Sort
View
BIRTHDAY
2003
Springer
15 years 11 months ago
From CTL to Datalog
We provide a translation from CTL to Datalog¬ Succ. The translation has the following advantages: a) It is natural. b) It provides intuition to the expressive power of CTL and it...
Foto N. Afrati, Theodore Andronikos, Vassia Pavlak...
CONCUR
1997
Springer
15 years 10 months ago
First-Order Axioms for Asynchrony
We study properties of asynchronous communication independently of any concrete concurrent process paradigm. We give a general-purpose, mathematically rigorous definition of sever...
Peter Selinger
BIRTHDAY
2006
Springer
15 years 10 months ago
Proving Behavioral Refinements of COL-specifications
The COL institution (constructor-based observational logic) has been introduced as a formal framework to specify both generationand observation-oriented properties of software syst...
Michel Bidoit, Rolf Hennicker
CSR
2006
Springer
15 years 10 months ago
Unfolding Synthesis of Asynchronous Automata
Zielonka's theorem shows that each regular set of Mazurkiewicz traces can be implemented as a system of synchronized processes provided with some distributed control structure...
Nicolas Baudru, Rémi Morin
BIRTHDAY
1991
Springer
15 years 10 months ago
Modal Logic Should Say More Than It Does
First-order modal logics, as traditionally formulated, are not expressive enough. It is this that is behind the difficulties in formulating a good analog of Herbrand’s Theorem, ...
Melvin Fitting