Sciweavers

206 search results - page 23 / 42
» On the Formal Structure of Continuous Action
Sort
View
FM
2001
Springer
108views Formal Methods» more  FM 2001»
14 years 1 days ago
Improvements in BDD-Based Reachability Analysis of Timed Automata
To develop efficient algorithms for the reachability analysis of timed automata, a promising approach is to use binary decision diagrams (BDDs) as data structure for the representa...
Dirk Beyer
HYBRID
2010
Springer
14 years 2 months ago
From synchronous programs to symbolic representations of hybrid systems
In this paper, we present an extension of the synchronous language Quartz by new kinds of variables, actions and statements for modeling the interaction of synchronous systems wit...
Kerstin Bauer, Klaus Schneider
COORDINATION
2004
Springer
14 years 29 days ago
On Calculi for Context-Aware Coordination
Abstract. Modern distributed computing demands unprecedented levels of dynamicity and reconfiguration. Mobile computing, peer-to-peer networks, computational grids, multiagent sys...
Pietro Braione, Gian Pietro Picco
COSIT
1997
Springer
143views GIS» more  COSIT 1997»
13 years 11 months ago
Using Hierarchical Spatial Data Structures for Hierarchical Spatial Reasoning
This paper gives a definition of Hierarchical Spatial Reasoning, which computes increasingly better results in a hierarchical fashion and stops the computation when a result is ac...
Sabine Timpf, Andrew U. Frank
ECSCW
2001
13 years 9 months ago
Team automata for spatial access control
Abstract. Team automata provide a framework for capturing notions like coordination, colon, and cooperation in distributed systems. They consist of an abstract specification of com...
Maurice H. ter Beek, Clarence A. Ellis, Jetty Klei...