Closure operators for order structures

Authors:
Ryszard Janicki;Dai Tri Man Lê;Nadezhda Zubkova
Affiliations:
Department of Computing and Software, McMaster University, Hamilton, Canada;Department of Computer Science, University of Toronto, Toronto, Canada;Department of Computing and Software, McMaster University, Hamilton, Canada
Venue:
FCT'09 Proceedings of the 17th international conference on Fundamentals of computation theory
Year:
2009

Citing 12
Cited 0

The mutual exclusion problem: part I—a theory of interprocess communication

Journal of the ACM (JACM)
Operational and algebraic semantics of concurrent processes

Handbook of theoretical computer science (vol. B)
Adequacy-preserving transformations of COSY path programs

Theoretical Computer Science
Structure of concurrency

Theoretical Computer Science
Semantics of inhibitor nets

Information and Computation
Colored Petri nets (vol. 3)

Colored Petri nets (vol. 3)
Elements of distributed algorithms: modeling and analysis with Petri nets

Elements of distributed algorithms: modeling and analysis with Petri nets
The Book of Traces

The Book of Traces
Invariants and Paradigms of Concurrency Theory

PARLE '91 Proceedings of Parallel Architectures and Languages - Volume II
Process semantics of general inhibitor nets

Information and Computation
Synchronous + Concurrent + Sequential = Earlier than + Not later than

ACSD '06 Proceedings of the Sixth International Conference on Application of Concurrency to System Design
Relational structures model of concurrency

Acta Informatica

Quantified Score

Hi-index	0.00

Visualization

Abstract

We argue that closure operators are fundamental tools for the study of relationships between order structures and their sequence representations. We also propose and analyse a closure operator for interval order structures.