Confluence for process verification
81
TL;DR: In this paper, several notions for confluence in processes and how these relate to τ-inertness are provided. But these notions can conveniently be used to simplify the structure of processes while preserving equivalence.
read more
About: This article is published in Theoretical Computer Science. The article was published on 15 Dec 1996. and is currently open access. The article focuses on the topics: Confluence & Equivalence (formal languages).
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
•Book
Introduction to Process Algebra
Wan Fokkink
- 23 Dec 1999
TL;DR: This textbook gives a thorough introduction into the basics of process algebra and its applications.
285
Concurrent Kleene Algebra and its Foundations
TL;DR: A Concurrent Kleene Algebra is investigated in terms of a primitive independence relation between the traces, and a series of richer algebras are developed; the richest validates a proof calculus for programs similar to that of a Jones style rely/guarantee calculus.
277
•Book
Modeling and Analysis of Communicating Systems
Jan Friso Groote,Mohammad Reza Mousavi +1 more
- 29 Aug 2014
TL;DR: This book introduces behavioral modeling, a rigorous approach to behavioral specification and verification of concurrent and distributed systems, and introduces a modeling language, mCRL2, that enables concise descriptions of even the most intricate distributed algorithms and protocols.
225
Hybrid process algebra
TL;DR: HyPA is an extension of the process algebra ACP, with the disrupt operator from LOTOS and with flow clauses and re-initialization clauses for the description of continuous behavior and discontinuities and a large set of axioms is presented for a notion of bisimilarity.
180
The mCRL2 toolset for analysing concurrent systems : improvements in expressivity and usability
Olav Bunte,Jan Friso Groote,Jeroen J. A. Keiren,Maurice Laveaux,Thomas Neele,Erik P. de Vink,Wieger Wesselink,Anton Wijs,Tim A. C. Willemse +8 more
- 06 Apr 2019
TL;DR: The mCRL2 language has been extended to support the modelling of probabilistic behaviour and the usability has been improved with the addition of refinement checking, counterexample generation and a user-friendly GUI.
References
Invariants in Process Algebra with Data
Marc Bezem,Jan Friso Groote +1 more
- 22 Aug 1994
TL;DR: In this article, the authors provide rules for calculating with invariants in process algebra with data, and illustrate these with examples, which are equivalent to the well known Recursive Specification Principle which states that guarded recursive equations have at most one solution.
A computer-checked verification of Milner''s scheduler.
Henri P. Korver,Jan Springintveld +1 more
- 19 Apr 1994
TL;DR: In this paper, an equational verification of Milner's scheduler is presented, which is the first time that the scheduler was proof-checked for a general number n of scheduled processes.
An algebraic characterization of transition system equivalences
André Arnold,Anne Dicky +1 more
TL;DR: This paper applies the method to prove M. Hennessy and C. Stirling's result that “Future Perfect” logic characterizes observation equivalence of generalized transition systems, i.e., systems whose infinite behaviours are restricted by arbitrary fairness constraints.
26
Verifying Process Algebra Proofs in Type Theory
M. P. A. Sellink
- 25 Oct 1993
TL;DR: In this paper, the authors study automatic verification of proofs in process algebra using the Calculus of Inductive Constructions (CIC) as implemented in the interactive proof construction program Coq.
•Journal Article
Verifying Process Algebra Proofs in Type Theory
TL;DR: In this paper, the authors study automatic verification of proofs in process algebra using the Calculus of Inductive Constructions as implemented in the interactive proof refinement program COQ. And they use a specific typed λ-calculus, which they use to verify proofs in the COQ program.
24