HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation

Context-Free Event Domains are recognizable

Eric Badouel 1 Philippe Darondeau 1 Jean-Claude Raoult 1
1 MICAS - Modèles et implémentation des calculs syntaxiques
IRISA - Institut de Recherche en Informatique et Systèmes Aléatoires, INRIA Rennes
Abstract : The possibly non distributive event domains which arise from Winskel's event structures with binary conflict are known to coincide with the domains of configurations of Stark's trace automata. We prove that whenever the transitive reduction of the order on finite elements in an event domain is a context-free graph in the sense of Müller and Schupp, that event domain may also be generated from a finite trace automaton, where both the set of states and the concurrent alphabet are finite. We show that the set of graph grammars which generate event domains is a recursive set. We obtain altogether an effective procedure which decides from an unlabelled graph grammar whether it generates an event domain and which constructs in that case a finite trace automaton recognizing that event domain. The advantage of trace automata over unlabelled graph grammars is to provide for a more concrete and therefore more tractable representation of event domains, well suited to an automated verification of their properties.
Document type :
Complete list of metadata

Contributor : Rapport de Recherche Inria Connect in order to contact the contributor
Submitted on : Wednesday, May 24, 2006 - 2:30:36 PM
Last modification on : Friday, February 4, 2022 - 3:25:31 AM
Long-term archiving on: : Monday, April 5, 2010 - 12:05:02 AM


  • HAL Id : inria-00074095, version 1


Eric Badouel, Philippe Darondeau, Jean-Claude Raoult. Context-Free Event Domains are recognizable. [Research Report] RR-2588, INRIA. 1995. ⟨inria-00074095⟩



Record views


Files downloads