Modeling concurrency with partial orders
International Journal of Parallel Programming
Event structures and trace monoids
Theoretical Computer Science
Finite labelling problem in event structures
Theoretical Computer Science - Special issue on number theory, combinatorics and applications to computer science
Handbook of logic in computer science (vol. 4)
An event structure semantics for general Petri nets
Theoretical Computer Science - Special volume on Petri nets
The Book of Traces
Event Structure Semantics for CCS and Related Languages
Proceedings of the 9th Colloquium on Automata, Languages and Programming
Local First Search - A New Paradigm for Partial Order Reductions
CONCUR '01 Proceedings of the 12th International Conference on Concurrency Theory
On distributed languages and models for concurrency
Advances in Petri Nets 1992, The DEMON Project
Using Unfoldings to Avoid the State Explosion Problem in the Verification of Asynchronous Circuits
CAV '92 Proceedings of the Fourth International Workshop on Computer Aided Verification
Ludics Nets, a game Model of Concurrent Interaction
LICS '05 Proceedings of the 20th Annual IEEE Symposium on Logic in Computer Science
Typed Event Structures and the π-Calculus
Electronic Notes in Theoretical Computer Science (ENTCS)
The implementation of mazurkiewicz traces in POEM
ATVA'06 Proceedings of the 4th international conference on Automated Technology for Verification and Analysis
| Hi-index | 0.00 |
We address the problem of finding nice labellings for event structures of degree 3. We develop a minimum theory by which we prove that the labelling number of an event structure of degree 3 is bounded by a linear function of the height. The main theorem we present in this paper states that event structures of degree 3 whose causality order is a tree have a nice labelling with 3 colors. Finally, we exemplify how to use this theorem to construct upper bounds for the labelling number of other event structures of degree 3.