Sciweavers

ENTCS
2008
87views more  ENTCS 2008»
13 years 4 months ago
A Lightweight Approach for the Semantic Validation of Model Refinements
Model Driven Engineering proposes the use of models at different levels of ion. Step by step validation of model refinements is necessary to guarantee the correctness of the final ...
Claudia Pons, Diego García
ENTCS
2008
83views more  ENTCS 2008»
13 years 4 months ago
A Coalgebraic Theory of Reactive Systems
Filippo Bonchi, Ugo Montanari
ENTCS
2008
87views more  ENTCS 2008»
13 years 4 months ago
The Complexity of Satisfiability for Fragments of CTL and CTL*
The satisfiability problems for CTL and CTL are known to be EXPTIME-complete, resp. 2EXPTIMEcomplete (Fischer and Ladner (1979), Vardi and Stockmeyer (1985)). For fragments that u...
Arne Meier, Martin Mundhenk, Michael Thomas, Herib...
ENTCS
2008
68views more  ENTCS 2008»
13 years 4 months ago
The Reach-and-Evolve Algorithm for Reachability Analysis of Nonlinear Dynamical Systems
This paper introduces a new algorithm dedicated to the rigorous reachability analysis of nonlinear dynamical systems. The algorithm is initially presented in the context of discre...
Pieter Collins, Alexandre Goldsztejn
ENTCS
2008
85views more  ENTCS 2008»
13 years 4 months ago
Dynamic Slicing Techniques for Petri Nets
Marisa Llorens, Javier Oliver, Josep Silva, Salvad...
ENTCS
2008
71views more  ENTCS 2008»
13 years 4 months ago
An Inverse Method for Parametric Timed Automata
Given a timed automaton with parametric timings, our objective is to describe a procedure for deriving constraints on the parametric timings in order to ensure that, for each valu...
Étienne André, Thomas Chatain, Laure...
ENTCS
2008
101views more  ENTCS 2008»
13 years 4 months ago
Monotonic Abstraction in Parameterized Verification
c Abstraction in Parameterized Verification Parosh Aziz Abdulla1 Department of Information Technology Uppsala University Sweden Giorgio Delzanno2 Dipartimento Informatica e Scienze...
Parosh Aziz Abdulla, Giorgio Delzanno, Ahmed Rezin...
ENTCS
2008
79views more  ENTCS 2008»
13 years 4 months ago
The Compositional Method and Regular Reachability
The compositional method, introduced by Feferman and Vaught in 1959, allows to reduce the model-checking problem for a product structure to the model-checking problem for its fact...
Ingo Felscher