Sciweavers

627 search results - page 16 / 126
» Branched Polyhedral Systems
Sort
View
JUCS
2006
97views more  JUCS 2006»
13 years 8 months ago
An Interval Constraint Branching Scheme for Lattice Domains
This paper presents a parameterized schema for interval constraint branching that (with suitable instantiations of the parameters) can solve interval constraint satisfaction probl...
Antonio J. Fernández, Patricia M. Hill
LOPSTR
2009
Springer
14 years 3 months ago
Deciding Full Branching Time Logic by Program Transformation
Abstract. We present a method based on logic program transformation, for verifying Computation Tree Logic (CTL∗ ) properties of finite state reactive systems. The finite state ...
Alberto Pettorossi, Maurizio Proietti, Valerio Sen...
CONCUR
2007
Springer
14 years 16 days ago
Equivalence Checking for Infinite Systems Using Parameterized Boolean Equation Systems
Abstract. In this paper, we provide a transformation from the branching bisimulation problem for infinite, concurrent, data-intensive systems in linear process format, into solving...
Taolue Chen, Bas Ploeger, Jaco van de Pol, Tim A. ...
DDECS
2006
IEEE
88views Hardware» more  DDECS 2006»
14 years 2 months ago
Minimization of Large State Spaces using Symbolic Branching Bisimulation
Abstract: Bisimulations in general are a powerful concept to minimize large finite state systems regarding some well-defined observational behavior. In contrast to strong bisimul...
Ralf Wimmer, Marc Herbstritt, Bernd Becker
FASE
2003
Springer
14 years 1 months ago
Detecting Implied Scenarios Analyzing Non-local Branching Choices
Scenarios are powerful tools to model and analyze software systems. However, since they do not provide a complete description of the system, but just some possible execution paths,...
Henry Muccini