1990
DOI: 10.1007/3-540-52148-8_1
|View full text |Cite
|
Sign up to set email alerts
|

Process calculi, from theory to practice: Verification tools

Abstract: HAL is a multidisciplinary open access archive for the deposit and dissemination of scientific research documents, whether they are published or not. The documents may come from teaching and research institutions in France or abroad, or from public or private research centers. L'archive ouverte pluridisciplinaire HAL, est destinée au dépôt et à la diffusion de documents scientifiques de niveau recherche, publiés ou non, émanant des établissements d'enseignement et de recherche français ou étrangers, des labora… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
14
0

Year Published

1992
1992
2011
2011

Publication Types

Select...
8
1

Relationship

0
9

Authors

Journals

citations
Cited by 31 publications
(14 citation statements)
references
References 3 publications
0
14
0
Order By: Relevance
“…The past ten years have seen the development of a variety of automatic verification tools for finite-state systems expressed in process algebra; examples include MAUTO [6], the Concurrency Workbench [10], TAV [14], and Ald~baran [11]. In general, these tools support a specific language, such as CCS [19], Meije [1], or Basic Lotos [5], for describing systems and provide users different methods, such as equivalence checking, preorder checking, model checking, random simulation, and abstraction mechanisms, for analyzing their behavior.…”
Section: Introductionmentioning
confidence: 99%
“…The past ten years have seen the development of a variety of automatic verification tools for finite-state systems expressed in process algebra; examples include MAUTO [6], the Concurrency Workbench [10], TAV [14], and Ald~baran [11]. In general, these tools support a specific language, such as CCS [19], Meije [1], or Basic Lotos [5], for describing systems and provide users different methods, such as equivalence checking, preorder checking, model checking, random simulation, and abstraction mechanisms, for analyzing their behavior.…”
Section: Introductionmentioning
confidence: 99%
“…The INRIA-Sophia Antipolis team of Robert de Simone and others proposed the notion of 'observation criteria' (Boudol, Roy, de Simone and Vergamini, 1989). The basic idea behind this notion is (1) to define contexts (that is, open systems with which the implementation labelled transition system is expected to interact) describing 'usage scenarios', (2) to put the system being verified in these contexts and (3) then use bisimilarity to compare the composite system to a labelled transition system representing an expected result.…”
Section: Some Uses Of Bisimilarity Checkingmentioning
confidence: 99%
“…Process Algebra Compiler [11] is a tool that takes the signature and the SOS rules of a language and generates a LEX/YACC scanner/parser as well as verification libraries (Lisp and in Standard ML which are respectively compiled with the kernels of the MAUTO tool [7] and the Concurrency Workbench [12]). In fact, PAC is a compiler that can be used as a front-end for verification tools.…”
Section: Related Workmentioning
confidence: 99%