Expressiveness modulo bisimilarity of regular expressions with parallel composition

@article{Baeten2010ExpressivenessMB,
  title={Expressiveness modulo bisimilarity of regular expressions with parallel composition},
  author={Jos C. M. Baeten and Bas Luttik and Tim Muller and P. J. A. van Tilburg},
  journal={Mathematical Structures in Computer Science},
  year={2010},
  volume={26},
  pages={933 - 968}
}
The languages accepted by finite automata are precisely the languages denoted by regular expressions. In contrast, finite automata may exhibit behaviours that cannot be described by regular expressions up to bisimilarity. In this paper, we consider extensions of the theory of regular expressions with various forms of parallel composition and study the effect on expressiveness. First we prove that adding pure interleaving to the theory of regular expressions strictly increases its expressiveness… 
View on Cambridge Press
arxiv.org
13 Citations
Background Citations
4

13 Citations

Sequencing and Intermediate Acceptance: Axiomatisation and Decidability of Bisimilarity

The equational theory of the recursion-free fragment of the resulting process theory modulo bisimilarity is studied, proving that it is not finitely based, but does afford a ground-complete axiomatisation if a unary auxiliary operator is added.

Sequencing and Intermediate Acceptance: Axiomatisation and Decidability of Bisimilarity

The equational theory of the recursion-free fragment of the resulting process theory modulo bisimilarity is studied, proving that it is not finitely based, but does afford a ground-complete axiomatisation if a unary auxiliary operator is added.

Pushdown Automata and Context-Free Grammars in Bisimulation Semantics

This paper considers the classical theorem of the correspondence between pushdown automata and context-free grammars and finds that the missing ingredient to recover the full correspondence is the addition of a notion of state awareness.

Equivalence checking for weak bi-Kleene algebra

A fragment of pomset automata is characterized that admits a decision procedure for language equivalence that corresponds precisely to series-rational expressions, i.e., rational expressions with an additional operator for bounded parallelism, and it is proved that equivalence of series- rational expressions is decidable.

The π-Calculus is Behaviourally Complete and Orbit-Finitely Executable

It is proved that if the finiteness requirement on reactive Turing machines and the associated notion of executability is relaxed to orbit-finiteness, then the $\pi$-calculus is executable up to (divergence-insensitive) branching bisimilarity.

Sequencing and intermediate acceptance

The equational theory of the recursion-free fragment of the resulting process theory modulo bisimilarity is studied, proving that it is not finitely based, but does afford a ground-complete axiomatisation if a unary auxiliary operator is added.

Reactive Turing machines

Sequential Composition in the Presence of Intermediate Termination (Extended Abstract)

A revised operational semantics for the sequential composition operator in the context of intermediate termination is proposed, which eliminates transparency and establishes a correspondence between context-free processes and pushdown processes.

Natural Projection as Partial Model Checking

It is proved that natural projection reduces to partial model checking and, when cast in a common setting, the two are equivalent and build a bridge whereby the control theory community can reuse algorithms and results developed by the verification community.

From Natural Projection to Partial Model Checking and Back

This paper shows that, under reasonable assumptions, natural projection reduces to partial model checking and, when cast in a common setting, the two are equivalent and builds a bridge whereby the control theory community can reuse algorithms and results developed by the verification community.

26 References

Concurrency and Automata on Infinite Sequences

  • D. Park
  • Computer Science
    Theoretical Computer Science
  • 1981
A general method for proving/deciding equivalences between omega-regular languages, whose recognizers are modified forms of Buchi or Muller-McNaughton automata, derived from Milner's notion of “simulation” is obtained.

Branching time and abstraction in bisimulation semantics

This paper investigates whether observation equivalence really does respect the branching structure of processes, and finds that in the presence of the unobservable action τ of CCS this is not the case, and the notion of branching bisimulation equivalence is introduced which strongly preserves the branching structures of processes.

A characterization of regular expressions under bisimulation

A set of so-called well-behaved finite automata that, modulo bisimulation equivalence, corresponds exactly to the set of regular expressions is defined, and it is shown how to determine whether a given finite automaton is in this set.

A congruence theorem for structured operational semantics of higher-order languages

  • Karen L. Bernstein
  • Computer Science
    Proceedings. Thirteenth Annual IEEE Symposium on Logic in Computer Science (Cat. No.98CB36226)
  • 1998
It is proved that bisimulation is a congruence for any language defined in promoted tyft/tyxt format and the usefulness of the rule format is demonstrated by presenting promoted tyf-tyxt definitions for the lazy /spl lambda/-calculus, CHOCS and the /spl pi/calculus.

A Congruence Theorem for Structured Operational Semantics with Predicates

It is proved that strong bisimulation is a congruence for all the operators that can be defined within the path format.

A Congruence Theorem for Structured Operational Semantics with Predicates and Negative Premises

We proposed a syntactic format, the panth format, for structured operational semantics in which besides ordinary transitions also predicates, negated predicates, and negative transitions may occur…

Handbook of Process Algebra

Preface (Bergstra, Ponse, Smolka). Part 1: Basic Theory. The linear time - brancing time spectrum I (Van Glabbeek). Trace-oriented models of concurrency (Broy, Olderog). Structural operational…

Towards a unified approach to encodability and separation results for process calculi

  • D. Gorla
  • Computer Science
    Inf. Comput.
  • 2010

The origins of structural operational semantics

  • G. Plotkin
  • Computer Science
    J. Log. Algebraic Methods Program.
  • 2004

Process Algebra with Recursive Operations