Algebraic laws for nondeterminism and concurrency
Journal of the ACM (JACM)
Petr nets, algebras, morphisms, and compositionality
Information and Computation
Information and Computation
Branching processes of Petri nets
Acta Informatica
Symbolic model checking: an approach to the state explosion problem
Symbolic model checking: an approach to the state explosion problem
Theoretical Computer Science
Time and duration in noninterleaving concurrency
Fundamenta Informaticae
Handbook of logic in computer science (vol. 4)
Process versus unfolding semantics for place/transition Petri nets
Theoretical Computer Science - Special volume on Petri nets
Theoretical Computer Science - Special volume on Petri nets
Timing and causality in process algebra
Acta Informatica
Bisimulation open maps for timed transition systems
Fundamenta Informaticae - Special issue dedicated to A. Salomaa
From Timed Automata to Logic - and Back
MFCS '95 Proceedings of the 20th International Symposium on Mathematical Foundations of Computer Science
Timing Petri Nets Categorically
ICALP '92 Proceedings of the 19th International Colloquium on Automata, Languages and Programming
An Improvement of McMillan's Unfolding Algorithm
TACAs '96 Proceedings of the Second International Workshop on Tools and Algorithms for Construction and Analysis of Systems
Efficient Scaling-Invariant Checking of Timed Bisimulation
STACS '97 Proceedings of the 14th Annual Symposium on Theoretical Aspects of Computer Science
On the Category of Petri Net Computations
TAPSOFT '95 Proceedings of the 6th International Joint Conference CAAP/FASE on Theory and Practice of Software Development
Model Checking of Time Petri Nets Based on Partial Order Semantics
CONCUR '99 Proceedings of the 10th International Conference on Concurrency Theory
On Specifying Real-Time Systems in a Causality-Based Setting
FTRTFT '96 Proceedings of the 4th International Symposium on Formal Techniques in Real-Time and Fault-Tolerant Systems
Obseving Behaviour Categorically
Proceedings of the 15th Conference on Foundations of Software Technology and Theoretical Computer Science
Timed Processes of Timed Petri Nets
Proceedings of the 16th International Conference on Application and Theory of Petri Nets
Time Processes for Time Petri-Nets
ICATPN '97 Proceedings of the 18th International Conference on Application and Theory of Petri Nets
Decidability of Bisimulation Equivalences for Parallel Timer Processes
CAV '92 Proceedings of the Fourth International Workshop on Computer Aided Verification
An Overview and Synthesis on Timed Process Algebras
Proceedings of the Real-Time: Theory in Practice, REX Workshop
| Hi-index | 0.00 |
The paper aims at extending the categorical approach to Petri net based models with time constraints. We define a category of net processes with dense time, and use the general framework of open maps to obtain a notion of bisimulation. We show this to be equivalent to the standard notion of timed bisimulation. Next, decidability of timed bisimulation is shown in the setting of finite net processes. Further, the result on decidability is applied to time safe Petri nets, using a timed version of the McMillan-unfolding.