Modeling concurrency with partial orders
International Journal of Parallel Programming
Petri net models for algebraic theories of concurrency
Volume II: Parallel Languages on PARLE: Parallel Architectures and Languages Europe
Axiomatizing net computations and processes
Proceedings of the Fourth Annual Symposium on Logic in computer science
Modeling and Verification of Time Dependent Systems Using Time Petri Nets
IEEE Transactions on Software Engineering
Using asynchronous Büchi automata for efficient automatic verification of concurrent systems
Proceedings of the Fifteenth IFIP WG6.1 International Symposium on Protocol Specification, Testing and Verification XV
Timing Petri Nets Categorically
ICALP '92 Proceedings of the 19th International Colloquium on Automata, Languages and Programming
Algebras of Processes of Timed Petri Nets
CONCUR '94 Proceedings of the Concurrency Theory
ANALYSIS OF ASYNCHRONOUS CONCURRENT SYSTEMS BY TIMED PETRI NETS
ANALYSIS OF ASYNCHRONOUS CONCURRENT SYSTEMS BY TIMED PETRI NETS
An efficient reactive planner for synthesizing reactive plans
AAAI'91 Proceedings of the ninth National conference on Artificial intelligence - Volume 2
Processes of Contextual Nets and their Characteristics
Fundamenta Informaticae
| Hi-index | 0.00 |
Structures called concatenable weighted pomsets are introduced which can serve as models of processes of Petri nets, including nets with time features. Operations on such structures are defined which allow to combine them sequentially and in parallel. These operations correspond to natural operations on processes. They make the universe of concatenable weighted pomsets a partial algebra which appears to be a symmetric strict monoidal category. Sets of processes of timed and time Petri nets are characterized as subsets of this algebra.