Properties of Distributed Timed-Arc Petri Nets

Warning

This publication doesn't include Faculty of Economics and Administration. It includes Faculty of Informatics. Official publication website can be found on muni.cz.

Authors	NIELSEN Mogens SASSONE Vladimiro SRBA Jiří
Year of publication	2001
Type	Article in Proceedings
Conference	Proceedings of 21st International Conference on Foundations of SoftwareTechnology and Theoretical Computer Science (FSTTCS'01)
MU Faculty or unit	Faculty of Informatics
Citation
Field	Information theory
Description	In [NSS01] we started a research on a distributed-timed extension of Petri nets where time parameters are associated with tokens and arcs carry constraints that qualify the age of tokens required for enabling. This formalism enables to model e.g. hardware architectures like GALS. We give a formal definition of process semantics for our model and investigate several properties of local versus global timing: expressiveness, reachability and coverability.
Related projects:	Infinite state concurrent systems - models and verification Non-sequential Models of Computing -- Quantum and Concurrent Distributed Models of Computing