Communicating sequential processes
Communicating sequential processes
On the consistency of Koomen's fair abstraction rule
Theoretical Computer Science
A timed model for communicating sequential processes
Theoretical Computer Science - Thirteenth International Colloquim on Automata, Languages and Programming, Renne
Process algebra
Communicating sequential processes
Communications of the ACM
Analysis of three hybrid systems in timed &mgr;CRL
Science of Computer Programming
The cones and foci proof technique for timed transition systems
Information Processing Letters
Communication and Concurrency
A Calculus of Communicating Systems
A Calculus of Communicating Systems
Introduction to Process Algebra
Introduction to Process Algebra
Fundamenta Informaticae
CCS + Time = An Interleaving Model for Real Time Systems
ICALP '91 Proceedings of the 18th International Colloquium on Automata, Languages and Programming
Completeness in Real Time Process Algebra
CONCUR '91 Proceedings of the 2nd International Conference on Concurrency Theory
CONCUR '92 Proceedings of the Third International Conference on Concurrency Theory
The syntax and semantics of timed $\mu CRL$
The syntax and semantics of timed $\'mu CRL$
Cones and foci for protocol verification revisited
FOSSACS'03/ETAPS'03 Proceedings of the 6th International conference on Foundations of Software Science and Computation Structures and joint European conference on Theory and practice of software
Is timed branching bisimilarity an equivalence indeed?
FORMATS'05 Proceedings of the Third international conference on Formal Modeling and Analysis of Timed Systems
| Hi-index | 0.00 |
The cones and foci verification method from Groote and Springintveld [J.F. Groote and J. Springintveld. Focus points and convergent process operators. A proof strategy for protocol verification. Journal of Logic and Algebraic Programming, 49(1/2): 31-60, 2001] was extended to timed systems by van der Zwaag [M.B. van der Zwaag. The cones and foci proof technique for timed transition systems. Information Processing Letters, 80(1): 33-40, 2001]. We present an extension of this cones and foci method for timed systems, which can cope with infinite @t-sequences. We prove soundness of our approach and give small verification examples.