Forgetting the time in timed process algebra: timeless behaviour in a timestamped world

Authors:
Anton Wijs
Affiliations:
Eindhoven University of Technology, Eindhoven, The Netherlands
Venue:
FMOODS'10/FORTE'10 Proceedings of the 12th IFIP WG 6.1 international conference and 30th IFIP WG 6.1 international conference on Formal Techniques for Distributed Systems
Year:
2010

Citing 13
Cited 0

Modeling and Verification of Time Dependent Systems Using Time Petri Nets

IEEE Transactions on Software Engineering
A theory of timed automata

Theoretical Computer Science
Branching time and abstraction in bisimulation semantics

Journal of the ACM (JACM)
Time-abstracted bisimulation: implicit specifications and decidability

Information and Computation
Analysis of Timed Systems Using Time-Abstracting Bisimulations

Formal Methods in System Design
The cones and foci proof technique for timed transition systems

Information Processing Letters
Communication and Concurrency

Communication and Concurrency
Completeness of timed #CRL

Fundamenta Informaticae
Automata For Modeling Real-Time Systems

ICALP '90 Proceedings of the 17th International Colloquium on Automata, Languages and Programming
µCRL: A Toolset for Analysing Algebraic Specifications

CAV '01 Proceedings of the 13th International Conference on Computer Aided Verification
Is Timed Branching Bisimilarity a Congruence Indeed?

Fundamenta Informaticae
Verification and improvement of the sliding window protocol

TACAS'03 Proceedings of the 9th international conference on Tools and algorithms for the construction and analysis of systems
Action abstraction in timed process algebra: the case for an untimed silent step

FSEN'07 Proceedings of the 2007 international conference on Fundamentals of software engineering

Quantified Score

Hi-index	0.00

Visualization

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.