Communicating sequential processes
Communicating sequential processes
A timed model for communicating sequential processes
International Colloquium on Automata, Languages and Programming on Automata, languages and programming
Advances in Petri nets 1986, part I on Petri nets: central models and their properties
Clocks and their use for time modeling
Trends in information systems
Theoretical Computer Science
Proofs and types
Finite representations of CCS and TCSP programs by automata and Petri nets
Finite representations of CCS and TCSP programs by automata and Petri nets
Mechanizing CSP Trace Theory in Higher Order Logic
IEEE Transactions on Software Engineering
Using higher order logic for modelling real-time protocols
TAPSOFT '91 Proceedings of the international joint conference on theory and practice of software development on Advances in distributed computing (ADC) and colloquium on combining paradigms for software development (CCPSD): Vol. 2
Combining interaction and automation in process algebra verification
TAPSOFT '91 Proceedings of the international joint conference on theory and practice of software development on Advances in distributed computing (ADC) and colloquium on combining paradigms for software development (CCPSD): Vol. 2
Embedded real-time systems
A Rely and Guarantee Method for Timed CSP: A Specification and Design of a Telephone Exchange
IEEE Transactions on Software Engineering
From algebra to operational semantics
Information Processing Letters
Design and validation of protocols: a tutorial
Computer Networks and ISDN Systems - Special issue on protocol specification, testing and verification
Structuring and automating hardware proofs in a higher-order theorem-proving environment
Formal Methods in System Design - Special issue on computer-aided verification: special methods II
Design of a delay-insensitive multiply-accumulate unit
Integration, the VLSI Journal - Special issue on asynchronous systems
The Boyer benchmark meets linear logic
ACM SIGPLAN Lisp Pointers
The algebra of timed processes, ATP: theory and application
Information and Computation
Methods of Logic in Computer Science
Executing HOL Specifications: Towards an Evaluation Semantics for Classical Higher Order Logic
HOL'92 Proceedings of the IFIP TC10/WG10.2 Workshop on Higher Order Logic Theorem Proving and its Applications
A Formalisation of the VHDL Simulation Cycle
HOL'92 Proceedings of the IFIP TC10/WG10.2 Workshop on Higher Order Logic Theorem Proving and its Applications
Modelling Non-Deterministic System in HOL
HOL'92 Proceedings of the IFIP TC10/WG10.2 Workshop on Higher Order Logic Theorem Proving and its Applications
Simulating Microprocessors from Formal Specifications
HOL'92 Proceedings of the IFIP TC10/WG10.2 Workshop on Higher Order Logic Theorem Proving and its Applications
Hierarchies in coloured Petri nets
Proceedings of the 10th International Conference on Applications and Theory of Petri Nets: Advances in Petri Nets 1990
Correctness and communication in real-time systems (tcsp)
Correctness and communication in real-time systems (tcsp)
Practical verification and synthesis of low latency asynchronous systems
Practical verification and synthesis of low latency asynchronous systems
| Hi-index | 0.00 |
A linear form of Reed-Roscoe Timed Communicating Sequential Processes mechanized with the Higher Order Logic Proof System is presented. The syntax for the Real-Time Linear CSP (RTLCSP) language is sufficient to describe the behavior of time-constrained communicating processes in real-time systems. The operational semantics of RTLCSP is expressed in terms of inference rules and Coloured Hierarchical Petri nets for a transition system for real-time programs. RTLCSP processes are characterized in terms of an extension of the Lynch-Tuttle signature for communicating processes. The signature of a process is helpful in reasoning about process behavior and in defining the semantics of empty processes or processes with hidden actions. The linear character of RTLCSP stems from its resource consciousness inasmuch as restrictions are placed on the number of times that a process can be restarted. The complete mechanization of RTLCSP in HOL (called RTLCSP-HOL) is presented in detail. The presentation includes a brief introduction to HOL itself to permit experimentation with RTLCSP-HOL. Sample HOL proofs relative to RTLCSP constructs are also given.