Nondeterministic regular expressions as solutions of equational systems

Authors:
Rocco De Nicola;Anna Labella
Affiliations:
Dipartimento di Sistemi e Informatica, Università di Firenze, Via Lombroso 6/17, Firenze I-50134, Italy;Dipartimento di Informatica Università di Roma "La Sapienza", Via Saleria, 113, Roma I-00198, Italy
Venue:
Theoretical Computer Science
Year:
2003

Citing 3
Cited 4

Iteration theories of synchronization trees

Information and Computation
Models of nondeterministic regular expressions

Journal of Computer and System Sciences
Theory of Automata

Theory of Automata

A characterization of regular expressions under bisimulation

Journal of the ACM (JACM)
A theory of contracts for Web services

ACM Transactions on Programming Languages and Systems (TOPLAS)
Contract-Based Discovery and Adaptation of Web Services

Formal Methods for Web Services
Contract-based discovery of Web services modulo simple orchestrators

Theoretical Computer Science

Quantified Score

Hi-index	5.23

Visualization

Abstract

We define the class of the linear systems whose solution is expressible as a tuple of nondeterministic regular expressions when they are interpreted as trees of actions rather than as sets of sequences. We precisely characterize those systems that have a regular expression as "canonical" solution, and show that any regular expression can be obtained as a canonical solution of a system of the defined class.