Results 21  30
of
150
Undecidable Equivalences for Basic Parallel Processes
 13th Conference on Foundations of Software Technology and Theoretical Computer Science
, 1993
"... . Recent results show that strong bisimilarity is decidable for the class of Basic Parallel Processes (BPP), which corresponds to the subset of CCS definable using recursion, action prefixing, nondeterminism and the full merge operator. In this paper we examine all other equivalences in the linear/b ..."
Abstract

Cited by 25 (2 self)
 Add to MetaCart
. Recent results show that strong bisimilarity is decidable for the class of Basic Parallel Processes (BPP), which corresponds to the subset of CCS definable using recursion, action prefixing, nondeterminism and the full merge operator. In this paper we examine all other equivalences in the linear/branching time hierarchy [12] and show that none of them are decidable for BPP. 1 Introduction Much attention has been devoted to the study of process calculi and in particular to behavioural semantics for these calculi. In order to capture the behavioural aspects of processes, a variety of equivalences have been proposed. Various criteria exist for comparing the merits and deficiencies of these equivalences. A systematic approach consists of classifying the equivalences according to their coarseness. For this purpose van Glabbeek proposed the linear/branching time spectrum which is illustrated in Figure 1 [12]. The least discriminating equivalences are at the bottom of the diagram. Arrows i...
A menagerie of nonfinitely based process semantics over BPA*—from ready simulation to completed traces
 Mathematical Structures in Computer Science
, 1998
"... Fokkink and Zantema ((1994) Computer Journal 37:259–267) have shown that bisimulation equivalence has a finite equational axiomatization over the language of Basic Process Algebra with the binary Kleene star operation (BPA ∗). In the light of this positive result on the mathematical tractability of ..."
Abstract

Cited by 24 (19 self)
 Add to MetaCart
Fokkink and Zantema ((1994) Computer Journal 37:259–267) have shown that bisimulation equivalence has a finite equational axiomatization over the language of Basic Process Algebra with the binary Kleene star operation (BPA ∗). In the light of this positive result on the mathematical tractability of bisimulation equivalence over BPA ∗ , a natural question to ask is whether any other (pre)congruence relation in van Glabbeek’s linear time/branching time spectrum is finitely (in)equationally axiomatizable over it. In this paper, we prove that, unlike bisimulation equivalence, none of the preorders and equivalences in van Glabbeek’s linear time/branching time spectrum, whose discriminating power lies in between that of ready simulation and that of completed traces, has a finite equational axiomatization. This we achieve by exhibiting a family of (in)equivalences that holds in ready simulation semantics, the finest semantics that we consider, whose instances cannot all be proven by means of any finite set of (in)equations
Axiomatizing GSOS with Termination
 THE JOURNAL OF LOGIC AND ALGEBRAIC PROGRAMMING
, 2004
"... ..."
A FrontEnd Generator for Verification Tools
, 1995
"... This paper describes the Process Algebra Compiler (PAC), a frontend generator for processalgebrabased verification tools. Given descriptions of a process algebra's concrete and abstract syntax and semantics as structural operational rules, the PAC produces syntactic routines and functions for com ..."
Abstract

Cited by 21 (5 self)
 Add to MetaCart
This paper describes the Process Algebra Compiler (PAC), a frontend generator for processalgebrabased verification tools. Given descriptions of a process algebra's concrete and abstract syntax and semantics as structural operational rules, the PAC produces syntactic routines and functions for computing the semantics of programs in the algebra. Using this tool greatly simplies the task of adapting verification tools to the analysis of systems described in different languages; it may therefore be used to achieve sourcelevel compatibility between different verication tools. Although the initial verication tools targeted by the PAC are MAUTO and the Concurrency Workbench, the structure of the PAC caters for the support of other tools as well.
Bisimilarity of Open Terms
, 2000
"... Traditionally, in process calculi, relations over open terms, i.e., terms with free process variables, are defined as extensions of closedterm relations: two open terms are related if and only if all their closed instantiations are related. Working in the context of bisimulation, in this paper we s ..."
Abstract

Cited by 20 (0 self)
 Add to MetaCart
Traditionally, in process calculi, relations over open terms, i.e., terms with free process variables, are defined as extensions of closedterm relations: two open terms are related if and only if all their closed instantiations are related. Working in the context of bisimulation, in this paper we study a different approach; we define semantic models for open terms, socalled conditional transition systems, and define bisimulation directly on those models. It turns out that this can be done in at least two different ways, one giving rise to De Simone's formal hypothesis bisimilarity and the other to a variation which we call hypothesispreserving bisimilarity (denoted t fh and t hp, respectively). For open terms, we have (strict) inclusions t fh /t hp / t ci (the latter denoting the standard ``closed instance' ' extension); for closed terms, the three coincide. Each of these relations is a congruence in the usual sense. We also give an alternative characterisation of t hp in terms of nonconditional transitions, as substitutionclosed bisimilarity (denoted t sb). Finally, we study the issue of recursion congruence: we prove that each of the above relations is a congruence with respect to the recursion operator; however, for t ci this result holds under more restrictive conditions than for tfh and thp.]
A congruence rule format for namepassing process calculi from mathematical structural operational semantics
 In Proc. LICS’06
, 2006
"... We introduce a GSOSlike rule format for namepassing process calculi. Specifications in this format correspond to theories in nominal logic. The intended models of such specifications arise by initiality from a general categorical model theory. For operational semantics given in this rule format, a ..."
Abstract

Cited by 20 (5 self)
 Add to MetaCart
We introduce a GSOSlike rule format for namepassing process calculi. Specifications in this format correspond to theories in nominal logic. The intended models of such specifications arise by initiality from a general categorical model theory. For operational semantics given in this rule format, a natural behavioural equivalence — a form of open bisimilarity — is a congruence.
A Process Algebraic Semantics for Statecharts via State Refinement
 In PROCOMET '94. North Holland/Elsevier
, 1994
"... this paper we put forth a process algebraic semantics for statecharts agreeing with [19]. In particular, we provide a translation of statecharts into a process algebra with state refinement , a new operator introduced by the authors in [22]. The semantics of a statechart is then given by the labeled ..."
Abstract

Cited by 19 (2 self)
 Add to MetaCart
this paper we put forth a process algebraic semantics for statecharts agreeing with [19]. In particular, we provide a translation of statecharts into a process algebra with state refinement , a new operator introduced by the authors in [22]. The semantics of a statechart is then given by the labeled transition system (LTS) of its translation, as defined by the process algebra's structural operational semantics (SOS). The benefits to be reaped by giving statecharts a process algebraic semantics include the following:
Trace Semantics for Coalgebras
, 2003
"... Traditionally, traces are the sequences of labels associated with paths in transition systems X # P(A X). ..."
Abstract

Cited by 18 (7 self)
 Add to MetaCart
Traditionally, traces are the sequences of labels associated with paths in transition systems X # P(A X).