Sciweavers

14 search results - page 1 / 3
» concur 2001
Sort
View
CONCUR
2001
Springer
13 years 9 months ago
An Algebraic Characterization of Data and Timed Languages
Patricia Bouyer, Antoine Petit, Denis Théri...
CONCUR
2001
Springer
13 years 9 months ago
Bounded Reachability Checking with Process Semantics
Bounded model checking has been recently introduced as an efficient verification method for reactive systems. In this work we apply bounded model checking to asynchronous systems....
Keijo Heljanko
CONCUR
2001
Springer
13 years 9 months ago
On the Power of Labels in Transition Systems
Abstract. In this paper we discuss the role of labels in transition systems with regard to bisimilarity and model checking problems. We suggest a general reduction from labelled tr...
Jirí Srba
CONCUR
2001
Springer
13 years 9 months ago
Probabilistic Information Flow in a Process Algebra
We present a process algebraic approach for extending to the probabilistic setting the classical logical information flow analysis of computer systems. In particular, we employ a ...
Alessandro Aldini