Skip to Main content Skip to Navigation
Conference papers

Forgetting the Time in Timed Process Algebra

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.
Document type :
Conference papers
Complete list of metadata

Cited literature [19 references]  Display  Hide  Download

https://hal.inria.fr/hal-01055216
Contributor : Hal Ifip <>
Submitted on : Monday, August 11, 2014 - 5:20:11 PM
Last modification on : Friday, August 11, 2017 - 4:16:22 PM
Long-term archiving on: : Wednesday, November 26, 2014 - 10:31:48 PM

File

61170108.pdf
Files produced by the author(s)

Licence


Distributed under a Creative Commons Attribution 4.0 International License

Identifiers

Citation

Anton Wijs. Forgetting the Time in Timed Process Algebra. Joint 12th IFIP WG 6.1 International Conference on Formal Methods for Open Object-Based Distributed Systems (FMOODS) / 30th IFIP WG 6.1 International Conference on Formal Techniques for Networked and Distributed Systems (FORTE), Jun 2010, Amsterdam, Netherlands. pp.110-124, ⟨10.1007/978-3-642-13464-7_10⟩. ⟨hal-01055216⟩

Share

Metrics

Record views

154

Files downloads

181