Truly Concurrent Process Algebra with Timing
Yong Wang

TL;DR
This paper extends the truly concurrent process algebra APTC by incorporating various timing models, including discrete and continuous, relative and absolute timing, to enhance its expressiveness for concurrent systems.
Contribution
It introduces a comprehensive extension of APTC with four types of timing, unifying discrete and continuous, relative and absolute timing models.
Findings
Unified framework for different timing models in APTC
Enhanced expressiveness for modeling timed concurrent systems
Foundation for further analysis of timed processes
Abstract
We extend truly concurrent process algebra APTC with timing related properties. Just like ACP with timing, APTC with timing also has four parts: discrete relative timing, discrete absolute timing, continuous relative timing and continuous absolute timing.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsFormal Methods in Verification · Petri Nets in System Modeling · Distributed systems and fault tolerance
