Sciweavers

384 search results - page 61 / 77
» On the Semantics of Markov Automata
Sort
View
116
Voted
FM
2003
Springer
146views Formal Methods» more  FM 2003»
15 years 7 months ago
Interacting State Machines for Mobility
We present two instantiations of generic Interactive State Machines (ISMs) with mobility features which are useful for modeling and verifying dynamically changing mobile systems. I...
Thomas A. Kuhn, David von Oheimb
PODS
2010
ACM
213views Database» more  PODS 2010»
15 years 7 months ago
Expressive languages for path queries over graph-structured data
For many problems arising in the setting of graph querying (such as finding semantic associations in RDF graphs, exact and approximate pattern matching, sequence alignment, etc.)...
Pablo Barceló, Carlos A. Hurtado, Leonid Li...
HYBRID
1994
Springer
15 years 6 months ago
Symbolic Controller Synthesis for Discrete and Timed Systems
This paper presents algorithms for the symbolic synthesis of discrete and real-time controllers. At the semantic level the controller is synthesized by nding a winning strategy for...
Eugene Asarin, Oded Maler, Amir Pnueli
AMAST
2006
Springer
15 years 5 months ago
Some Programming Languages for Logspace and Ptime
We propose two characterizations of complexity classes by means of programming languages. The first concerns Logspace while the second leads to Ptime. This latter characterization ...
Guillaume Bonfante
98
Voted
ZUM
2000
Springer
15 years 5 months ago
Retrenchment, Refinement, and Simulation
: Retrenchment is introduced as a liberalisation of refinement intended to address some of the shortcomings of refinement as sole means of progressing from simple abstract models t...
Richard Banach, Michael Poppleton