Context-free event domains are recognizable
From MaRDI portal
Publication:1286370
DOI10.1006/inco.1998.2752zbMath0928.68050OpenAlexW2079207854MaRDI QIDQ1286370
Eric Badouel, Philippe Darondeau, Jean Claude Raoult
Publication date: 3 May 1999
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://hal.inria.fr/inria-00074095/file/RR-2588.pdf
Related Items (2)
A counterexample to Thiagarajan's conjecture on regular event structures ⋮ A Nice labelling for tree-like event structures of degree 3
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the regular structure of prefix rewriting
- The theory of ends, pushdown automata, and second-order logic
- On the consistency of Koomen's fair abstraction rule
- Effectively given domains
- Petri nets, event structures and domains. I
- A logical characterization of well branching event structures
- Extending partial isomorphisms of graphs
- Flow models of distributed computations: Three equivalent semantics for CCS
- Extending partial isomorphisms on finite structures
- Decidability of bisimulation equivalence for process generating context-free languages
- Compositional relational semantics for indeterminate dataflow networks
- Connections between a concrete and an abstract model of concurrent systems
This page was built for publication: Context-free event domains are recognizable
