Information and Computation
Petri nets and automata with concurrency relations—an adjunction
Semantics of programming languages and model theory
Lectures on Petri Nets I: Basic Models, Advances in Petri Nets, the volumes are based on the Advanced Course on Petri Nets
Reasoning about Algebraic Generalisation of Petri Nets
Proceedings of the 20th International Conference on Application and Theory of Petri Nets
Dualities Between Nets and Automata Induced by Schizophrenic Objects
CTCS '95 Proceedings of the 6th International Conference on Category Theory and Computer Science
Modeling of hybrid systems using continuous and hybrid Petri nets
PNPM '97 Proceedings of the 6th International Workshop on Petri Nets and Performance Models
Parameterized Net Classes: A Uniform Approach to Petri Net Classes
Unifying Petri Nets, Advances in Petri Nets
Fundamenta Informaticae
Partial Order Semantics of Types of Nets
SOFSEM '09 Proceedings of the 35th Conference on Current Trends in Theory and Practice of Computer Science
Nets enriched over closed monoidal structures
ICATPN'03 Proceedings of the 24th international conference on Applications and theory of Petri nets
Fundamenta Informaticae
A categorical observation of timed testing equivalence
PaCT'07 Proceedings of the 9th international conference on Parallel Computing Technologies
| Hi-index | 0.00 |
We consider two generalizations of the duality between transition systems and Petri nets. In the first, transitions are replaced by paths, that is partial functions from a fixed set 驴 to states. This allows to model continuous and/or hybrid systems when 驴 represents durations. In the second generalization actions are considered to have a structure given by an algebra. This allows to model, for instance, sequential and parallel composition of ordinary actions. In each case the question of the existence of a Galois connection is considered in the framework of ordered sets and in the categorical setting.