Abstract | ||
---|---|---|
In this paper, we propose the notion of partial time abstraction for timed process algebras, which introduces the possibility
to abstract away parts of the timing of system behaviour. Adding this notion leads to so-called partially timed process algebras
and partially timed labelled transition systems. We describe these notions, and generalise timed branching bisimilarity to
partially timed branching bisimilarity, allowing the comparison of systems with partial timing. Finally, with several examples
and a case study, we demonstrate how partial time abstraction can be a useful modelling technique for timed models, which
can lead to rigorous minimisations of state spaces.
|
Year | DOI | Venue |
---|---|---|
2010 | 10.1007/978-3-642-13464-7_10 | FMOODS/FORTE |
Keywords | DocType | Citations |
process algebra,state space | Conference | 0 |
PageRank | References | Authors |
0.34 | 13 | 1 |
Name | Order | Citations | PageRank |
---|---|---|---|
Anton Wijs | 1 | 203 | 22.84 |