Modeling concurrency with partial orders
International Journal of Parallel Programming
Sequential and concurrent behaviour in Petri net theory
Theoretical Computer Science
The equational theory of pomsets
Theoretical Computer Science
An extension of Kleene's and Ochman´ski's theorems to infinite traces
Theoretical Computer Science
Partial-order transport service for multimedia and other applications
IEEE/ACM Transactions on Networking (TON)
Comparing locality and causality based equivalences
Acta Informatica
Rational and recognizable complex trace languages
Information and Computation
Unreliable channels are easier to verify than perfect channels
Information and Computation
Recognizable languages in concurrency monoids
Theoretical Computer Science
From the partial order connection concept to partial order multimedia transport connections
Journal of High Speed Networks - Special issue on HIPPARCH
Representation of computations in concurrent automata by dependence orders
Theoretical Computer Science
Modular Construction and Partial Order Semantics of Petri Nets
Modular Construction and Partial Order Semantics of Petri Nets
Observing Partial Order Runs of Petri Nets
Foundations of Computer Science: Potential - Theory - Cognition, to Wilfried Brauer on the occasion of his sixtieth birthday
Series-Parallel Posets: Algebra, Automata and Languages
STACS '98 Proceedings of the 15th Annual Symposium on Theoretical Aspects of Computer Science
Proceedings of the 17th International Conference on Application and Theory of Petri Nets
A fifo-net model for processes with asynchronous communication
Advances in Petri Nets 1992, The DEMON Project
Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency, School/Workshop
Relationships Between Models of Concurrency
A Decade of Concurrency, Reflections and Perspectives, REX School/Symposium
Relationships Between Models of Concurrency
A Decade of Concurrency, Reflections and Perspectives, REX School/Symposium
| Hi-index | 0.00 |
We present a new class of nets which includes and extends both Coloured Nets and Fifo Nets by defining weights on edges and markings of places as traces on a concurrent (trace) alphabet. Considering different independence relations on the alphabet, from the maximal one to the empty one (yielding words), Trace Channel Nets open a hierarchy of semantics on a single net structure. Furthermore a field of investigation results from the relationship between the independence on the alphabet and the behaviours of the net. In particular we show that the boundedness of a TCNet is related to particular independence relations, maximal w.r.t. boundedness, that TCNets can be applied to the study of Communicating Finite State Machines (using communication through a trace channel), and that they define a hierarchy of partial order semantics for Nets.