Introduction to the ISO specification language LOTOS

T Bolognesi, E Brinksma - Computer Networks and ISDN systems, 1987 - Elsevier
LOTOS is a specification language that has been specifically developed for the formal
description of the OSI (Open Systems Interconnection) architecture, although it is applicable …

Modeling component connectors in Reo by constraint automata

C Baier, M Sirjani, F Arbab, J Rutten - Science of computer programming, 2006 - Elsevier
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 …

An efficient algorithm for branching bisimulation and stuttering equivalence

JF Groote, F Vaandrager - International Colloquium on Automata …, 1990 - Springer
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 …

An implementation of an efficient algorithm for bisimulation equivalence

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 …

[PDF][PDF] On algorithmic verification methods for probabilistic systems

C Baier - 1998 - researchgate.net
Parallel systems (such as operating systems, telecommunication systems, aircraft controlling
systems, banking systems, etc.) arise in many industrial applications. For applications where …

Deciding bisimilarity and similarity for probabilistic processes

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 …

[图书][B] On a Markovian process algebra

P Buchholz - 1994 - Citeseer
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 …

[图书][B] Alea jacta est: verification of probabilistic, real-time and parametric systems

MIA Stoelinga - 2002 - repository.ubn.ru.nl
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 …

On-the-fly verification of finite transition systems

JC Fernandez, L Mounier, C Jard, T Jéron - Formal Methods in System …, 1992 - Springer
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 …

A process algebra of communicating shared resources with dense time and priorities

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 …