Synchronous reactive formalisms associate concurrent behaviors to precise schedules on global clock(s). This allows a non-ambiguous notion of "absent" signal, which can ...
Dumitru Potop-Butucaru, Robert de Simone, Yves Sor...
In a seminal paper from 1985, Sistla and Clarke showed that satisfiability for Linear Temporal Logic (LTL) is either NP-complete or PSPACE-complete, depending on the set of tempora...
Michael Bauland, Thomas Schneider 0002, Henning Sc...
The network protocols we use today have been introduced decades ago. Since then the whole Internet came to existence and with it a single protocol stack: TCP/IP. What was a good s...
Dennis Schwerdel, Abbas Siddiqui, Bernd Reuther, P...
Model-driven application engineering builds on the concept of model transformations. To weave additional refinement parts into an application model, so-called refinement transform...
System configuration management is difficult because systems evolve in an undisciplined way: packages are upgraded, configuration files are edited, and so on. The management of ex...