Sciweavers

1175 search results - page 128 / 235
» Abstract computability and algebraic specification
Sort
View
CSL
2010
Springer
15 years 7 months ago
Exact Exploration and Hanging Algorithms
Abstract. Recent analysis of sequential algorithms resulted in their axiomatization and in a representation theorem stating that, for any sealgorithm, there is an abstract state ma...
Andreas Blass, Nachum Dershowitz, Yuri Gurevich
CDC
2010
IEEE
144views Control Systems» more  CDC 2010»
15 years 1 months ago
Formal analysis of piecewise affine systems through formula-guided refinement
Abstract-- We present a computational framework for identifying a set of initial states from which all trajectories of a piecewise affine (PWA) system satisfy a Linear Temporal Log...
Boyan Yordanov, Jana Tumova, Calin Belta, Ivana Ce...
DLT
2009
15 years 4 months ago
Branching-Time Temporal Logics with Minimal Model Quantifiers
Abstract. Temporal logics are a well investigated formalism for the specification and verification of reactive systems. Using formal verification techniques, we can ensure the corr...
Fabio Mogavero, Aniello Murano
CONCUR
2008
Springer
15 years 8 months ago
Distributed Timed Automata with Independently Evolving Clocks
Abstract. We propose a model of distributed timed systems where each component is a timed automaton with a set of local clocks that evolve at a rate independent of the clocks of th...
S. Akshay, Benedikt Bollig, Paul Gastin, Madhavan ...
ECSCW
2001
15 years 7 months ago
Flexible support for application-sharing architecture
Current application-sharing systems support a single architecture for all collaborations, though different systems support different architectures We have developed a system that s...
Goopeel Chung, Prasun Dewan