CIRCAL and the representation of communication, concurrency, and time
ACM Transactions on Programming Languages and Systems (TOPLAS) - Lecture notes in computer science Vol. 174
Communicating sequential processes
Communicating sequential processes
A fast mutual exclusion algorithm
ACM Transactions on Computer Systems (TOCS)
Communications of the ACM
ACM Transactions on Programming Languages and Systems (TOPLAS)
Theoretical Computer Science
ACM Transactions on Programming Languages and Systems (TOPLAS)
Four-phase micropipeline latch control circuits
IEEE Transactions on Very Large Scale Integration (VLSI) Systems
Communication and Concurrency
Formal Specification and Verification of Digital Systems
Formal Specification and Verification of Digital Systems
The Theory and Practice of Concurrency
The Theory and Practice of Concurrency
A Methodology for the Formal Analysis of Asynchronous Micropipelines
FMCAD '00 Proceedings of the Third International Conference on Formal Methods in Computer-Aided Design
Modelling a Time-Dependent Protocol Using the Circal Process Algebra
HART '97 Proceedings of the International Workshop on Hybrid and Real-Time Systems
An Overview and Synthesis on Timed Process Algebras
CAV '91 Proceedings of the 3rd International Workshop on Computer Aided Verification
Integrating the Verification of Timing, Performance and Correctness Properties of Concurrent Systems
CSD '98 Proceedings of the 1998 International Conference on Application of Concurrency to System Design
| Hi-index | 0.00 |
This paper presents a novel application of an untimed process algebra formalism to a class of timing-critical verification problems usually modelled with either timed automata or timed process algebra. We show that a formalism based on interacting automata can model system components, behavioural constraints and properties requiring proof without elaborating the underlying process-algebraic formalism to include explicit timing constructs; and that properties can be verified without introducing temporal logic, model-checking, or refinement relation checking. We demonstrate this technique in detail by application to the Fischer mutual-exclusion protocol, an archetypal example of a system that depends of timing constraints to operate correctly.