CR-Structures

Authors:
Vincent Schmitt
Affiliations:
IRISA-IFSIC, University of Rennes 1 Rennes, France. email vschmitt@irisa.fr
Venue:
Fundamenta Informaticae
Year:
1998

Citing 11
Cited 0

Trace theory

Advances in Petri nets 1986, part II on Petri nets: applications and relationships to other models of concurrency
Event structures and domains

Theoretical Computer Science
Connections between a concrete and an abstract model of concurrent systems

Proceedings of the fifth international conference on Mathematical foundations of programming semantics
Event structures and trace monoids

Theoretical Computer Science
Labelled domains and automata with concurrency

Theoretical Computer Science
Representation of computations in concurrent automata by dependence orders

Theoretical Computer Science
Categorical Combinators, Sequential Algorithms and Funtional Programming

Categorical Combinators, Sequential Algorithms and Funtional Programming
Concurrency, Automata and Domains

ICALP '90 Proceedings of the 17th International Colloquium on Automata, Languages and Programming
Trace Nets

Proceedings of the REX Workshop on Sematics: Foundations and Applications
Nondeterministic Automata with Concurrency Relations and Domains

CAAP '94 Proceedings of the 19th International Colloquium on Trees in Algebra and Programming
Categories of asynchronous systems

Categories of asynchronous systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper CR-structures are introduced. They consist of a slight generalization of general event structures [16], and supply a representation theorem for concurrency domains, - which are called here CR-domains for short. We recall that the latter domains are exactly the unfoldings of concurrent automata [7],[3]. This result also generalizes Droste's characterization of domains of configurations of general event structures [6].