Skip to main content
Conference Proceedings

Modelling with partial orders why and why not? extended abstract

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2001) 2076 LNCS 61-63
DOI: 10.1007/3-540-48224-5_5
N/ACitations
Citations of this article
11Readers
Mendeley users who have this article in their library.
Get full text

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. © 2011 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Nielsen, M. (2001). Modelling with partial orders why and why not? extended abstract. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2076 LNCS, pp. 61–63). Springer Verlag. https://doi.org/10.1007/3-540-48224-5_5

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free