Undecidability results for deterministic communicating sequential processes
- 1 January 1990
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automatic Control
- Vol. 35 (9) , 1032-1039
- https://doi.org/10.1109/9.58531
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Finitely recursive process models for discrete event systemsIEEE Transactions on Automatic Control, 1988
- Automated protocol implementation with RTAGIEEE Transactions on Software Engineering, 1988
- An Algorithm for the General Petri Net Reachability ProblemSIAM Journal on Computing, 1984
- The ``Hoare Logic'' of CSP, and All ThatACM Transactions on Programming Languages and Systems, 1984
- A Proof System for Communicating Sequential ProcessesACM Transactions on Programming Languages and Systems, 1980
- A Calculus of Communicating SystemsLecture Notes in Computer Science, 1980
- Reducibility among Combinatorial ProblemsPublished by Springer Nature ,1972
- Parallel program schemataJournal of Computer and System Sciences, 1969
- Simple deterministic languagesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1966
- On Computable Numbers, with an Application to the EntscheidungsproblemProceedings of the London Mathematical Society, 1937