Is Timed Branching Bisimilarity an Equivalence Indeed?.
Wan J. FokkinkJun PangAnton WijsPublished in: FORMATS (2005)
Keyphrases
- petri net
- timed automata
- search tree
- branch and bound
- discrete event
- equivalence relation
- data sets
- artificial neural networks
- interactive dynamic influence diagrams
- dynamic systems
- rough set theory
- relational databases
- lower bound
- multiscale
- image segmentation
- case study
- information systems
- computer vision
- databases