Scholarly Works

Deriving histories of nets with priority relation

Deriving histories of nets with priority relation

Abstract

Relational structures representing causality and weak causality can be used to provide a ‘truly concurrent’ semantics of Petri Nets with priorities. We show how to derive such structures by generalising the standard construction of causal partial orders based on occurrence nets.

Authors

Janicki R; Koutny M

Series

Lecture Notes in Computer Science

Volume

817

Pagination

pp. 623-634

Publisher

Springer Nature

Publication Date

January 1, 1994

DOI

10.1007/3-540-58184-7_136

Conference proceedings

Lecture Notes in Computer Science

ISSN

0302-9743

Associated Experts

Maciej Koutny

Adjunct Professor, Faculty of Engineering

Ryszard Janicki

Professor, Faculty of Engineering

Labels

Fields of Research (FoR)

4613 Theory Of Computation 46 Information and computing sciences

View published work (Non-McMaster Users)

Contact the Experts team

Get technical help

or

Provide website feedback