The Geometry of Timed PV Programs
Ulrich Fahrenberg · Electronic Notes in Theoretical Computer Science · 2003
We introduce a real-time extension of the PV language: A timed PV program consists of a number of timed automata which synchronize by locking and releasing common resources. We give a geometric semantics to such programs in terms of local po-spaces, and we work towards making the established geometric techniques available for detecting deadlocks and unsafe configurations in timed PV programs.