Event Structures for Resolvable Conflict

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract / Description of output

We propose a generalisation of Winskel's event structures, matching the expressive power of arbitrary Petri nets. In particular, our event structures capture resolvable conflict, besides disjunctive and conjunctive causality.
Original languageEnglish
Title of host publicationMathematical Foundations of Computer Science 2004: 29th International Symposium, MFCS 2004, Prague, Czech Republic, August 22-27, 2004, Proceedings
EditorsJiří Fiala, Václav Koubek, Jan Kratochvíl
Place of PublicationHeidelberg
PublisherSpringer
Pages550-561
Number of pages12
ISBN (Electronic)978-3-540-28629-5
ISBN (Print)978-3-540-22823-3
DOIs
Publication statusPublished - 27 Aug 2004
EventThe 9th International Symposium on Mathematical Foundations of Computer Science, 2004 - Prague, Czech Republic
Duration: 22 Aug 200427 Aug 2004
Conference number: 9

Publication series

NameLecture Notes in Computer Science
PublisherSpringer Berlin, Heidelberg
Volume3153
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Symposium

SymposiumThe 9th International Symposium on Mathematical Foundations of Computer Science, 2004
Abbreviated titleMFCS 2004
Country/TerritoryCzech Republic
CityPrague
Period22/08/0427/08/04

Fingerprint

Dive into the research topics of 'Event Structures for Resolvable Conflict'. Together they form a unique fingerprint.

Cite this