Sciweavers

6 search results - page 1 / 2
» Learning Communicating Automata from MSCs
Sort
View
TSE
2010
96views more  TSE 2010»
12 years 11 months ago
Learning Communicating Automata from MSCs
Benedikt Bollig, Joost-Pieter Katoen, Carsten Kern...
APN
2006
Springer
13 years 8 months ago
The Synthesis Problem of Netcharts
A netchart is basically a Petri net whose places are located at some process and whose transitions are labeled by message sequence charts (MSCs). Two recent papers showed independe...
Nicolas Baudru, Rémi Morin
ICFEM
2004
Springer
13 years 10 months ago
Learning to Verify Safety Properties
We present a novel approach for verifying safety properties of finite state machines communicating over unbounded FIFO channels that is based on applying machine learning techniqu...
Abhay Vardhan, Koushik Sen, Mahesh Viswanathan, Gu...
FM
2003
Springer
146views Formal Methods» more  FM 2003»
13 years 10 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
2004
ACM
137views Database» more  PODS 2004»
14 years 4 months ago
On the Memory Requirements of XPath Evaluation over XML Streams
The important challenge of evaluating XPath queries over XML streams has sparked much interest in the past few years. A number of algorithms have been proposed, supporting wider f...
Ziv Bar-Yossef, Marcus Fontoura, Vanja Josifovski