Sciweavers

427 search results - page 50 / 86
» On the Power of Labels in Transition Systems
Sort
View
TACAS
1997
Springer
146views Algorithms» more  TACAS 1997»
15 years 4 months ago
Compositional State Space Generation from Lotos Programs
This paper describes a compositional approach to generate the labeled transition system representing the behavior of a Lotos program by repeatedly alternating composition and reduc...
Jean-Pierre Krimm, Laurent Mounier
FOSSACS
2000
Springer
15 years 3 months ago
On Recognizable Stable Trace Languages
We relate several models of concurrency introduced in the literature in order to extend classical Mazurkiewicz traces. These are mainly Droste's concurrent automata and Arnold...
Jean-François Husson, Rémi Morin
FASE
2008
Springer
15 years 1 months ago
A Model Checking Approach for Verifying COWS Specifications
We introduce a logical verification framework for checking functional properties of service-oriented applications formally specified using the service specification language COWS. ...
Alessandro Fantechi, Stefania Gnesi, Alessandro La...
PTS
2008
109views Hardware» more  PTS 2008»
15 years 1 months ago
Runtime Verification of C Programs
We present in this paper a framework, RMOR, for monitoring the execution of C programs against state machines, expressed in a textual (nongraphical) format in files separate from t...
Klaus Havelund
ECEASST
2008
106views more  ECEASST 2008»
14 years 12 months ago
Controlling resource access in Directed Bigraphs
: We study directed bigraph with negative ports, a bigraphical framework for representing models for distributed, concurrent and ubiquitous computing. With respect to previous vers...
Davide Grohmann, Marino Miculan