Sciweavers

BIRTHDAY
2008
Springer
13 years 10 months ago
Semiring-Based Soft Constraints
The semiring-based formalism to model soft constraint has been introduced in 1995 by Ugo Montanari and the authors of this paper. The idea was to make constraint programming more f...
Stefano Bistarelli, Francesca Rossi
BIRTHDAY
2008
Springer
13 years 10 months ago
Approximating Behaviors in Embedded System Design
Embedded systems are electronic devices that function in the context of a physical environment, by sensing and reacting to a set of stimuli. To simplify the design of embedded syst...
Roberto Passerone, Alberto L. Sangiovanni-Vincente...
BIRTHDAY
2008
Springer
13 years 10 months ago
Event-Based Service Coordination
Abstract. In this paper we tackle the problem of designing and implementing a framework for programming service coordination policies. In particular, we illustrate the design and t...
Gian Luigi Ferrari, Roberto Guanciale, Daniele Str...
BIRTHDAY
2008
Springer
13 years 10 months ago
Transformations in Reconfigurable Place/Transition Systems
Reconfigurable place/transition systems are Petri nets with initial markings and a set of rules which allow the modification of the net during runtime in order to adapt the net to ...
Ulrike Prange, Hartmut Ehrig, Kathrin Hoffmann, Ju...
BIRTHDAY
2008
Springer
13 years 10 months ago
The Seventies
Alberto Martelli
BIRTHDAY
2008
Springer
13 years 10 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
BIRTHDAY
2008
Springer
13 years 10 months ago
Church's Problem and a Tour through Automata Theory
Abstract. Church's Problem, stated fifty years ago, asks for a finitestate machine that realizes the transformation of an infinite sequence into an infinite sequence such tha...
Wolfgang Thomas
BIRTHDAY
2008
Springer
13 years 10 months ago
Proof Search Tree and Cut Elimination
Grigori Mints
BIRTHDAY
2008
Springer
13 years 10 months ago
Checking Temporal Properties of Discrete, Timed and Continuous Behaviors
We survey some of the problems associated with checking whether a given behavior (a sequence, a Boolean signal or a continuous signal) satisfies a property specified in an appropri...
Oded Maler, Dejan Nickovic, Amir Pnueli
BIRTHDAY
2008
Springer
13 years 10 months ago
Tree Automata over Infinite Alphabets
A number of models of computation on trees labeled with symbols from an infinite alphabet is considered. We study closure and decision properties of each of the models and compare ...
Michael Kaminski, Tony Tan