In this paper we introduce constraint automata and propose them as an operational model for Reo, an exogenous coordination language for compositional construction of component …
This paper presents an efficient algorithm for the Relational Coarsest Partition with Stuttering problem (RCPS). The RCPS problem is closely related to the problem of deciding stuttering …
JC Fernandez - Science of Computer Programming, 1990 - Elsevier
We present an efficient algorithm for bisimulation equivalence. Generally, bisimulation equivalence can be tested in O (mn) for a labeled transition system with m transitions and n …
Parallel systems (such as operating systems, telecommunication systems, aircraft controlling systems, banking systems, etc.) arise in many industrial applications. For applications where …
C Baier, B Engelen, M Majster-Cederbaum - Journal of Computer and …, 2000 - Elsevier
This paper deals with probabilistic and nondeterministic processes represented by a variant of labeled transition systems where any outgoing transition of a state s is augmented with …
Process algebras extended by a concept to present timing behaviour have been very recently proposed as a good modelling tool for the combined analysis of qualitative and …
Alea jacta est. With the printing of this thesis, almost five years of research end. This was a period of hard work, of astonishing elegance and beauty present in concurrency theory, with …
The analysis of programs by the exhaustive inspection of reachable states in a finite-state graph is a well-understood procedure. It is straightforwardly applicable to many description …
P Brémond-Grégoire, I Lee - Theoretical Computer Science, 1997 - Elsevier
The correctness of real-time distributed systems depends not only on the function they compute but also on their timing characteristics. Furthermore, those characteristics are …