Modelling with Partial Orders - Why and Why Not?

Authors:
Mogens Nielsen
Affiliations:
-
Venue:
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
Year:
2001

Citing 5
Cited 0

Modeling concurrency with partial orders

International Journal of Parallel Programming
Models for concurrency

Handbook of logic in computer science (vol. 4)
Undecidability of partial order logics

Information Processing Letters
On Message Sequence Graphs and Finitely Generated Regular MSC Languages

ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
A Meta-Notation for Protocol Analysis

CSFW '99 Proceedings of the 12th IEEE workshop on Computer Security Foundations

Quantified Score

Hi-index	0.00

Visualization

Abstract

Labelled partial orders in concurrency are a natural and powerful modelling formalism. Recently, there has been a renewed focus on such models arising in various areas of applications. We survey some results on interesting problems for partial order based models, focussing on decidability issues.