A practical technique for process abstraction

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 715 LNCS, Issue , 1993, Pages 37-49

  Bruns, Glenn ^a  

^a UNIVERSITY OF EDINBURGH   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SCIENCE; COMPUTERS;

ALGEBRAIC LAWS; DIRECT SIMPLIFICATION; PROPERTY-PRESERVING; TEMPORAL LOGIC FORMULA; TEMPORAL PROPERTY; TRANSITION SYSTEM;

ARTIFICIAL INTELLIGENCE;

EID: 84964213835     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-57208-2_4     Document Type: Conference Paper

References (13)

1. S. Bensalem, A. Bouajjani, C. Loiseaux, and J. Sifakis. Property preserving simulations. In Proceedings of the Fourth Workshop on Computer Aided Verification, 1992.
2. Gerard Boudol and Ilaria Castellani. Permutations of transitions: an event structure semantics for CCS and SCCS. In J.W. de Bakker, W.-P. de Roever, and G. Rozenberg, editors, Linear Time, Branching Time and Partial Order in Logics and Models. Springer Verlag, 1989. Lecture Notes in Computer Science, volume 354.
3. Glenn Bruns. A case study in safety-critical design. In Proceedings of CAV ‘92, 1992.
4. C.A.R. Hoare. Communicating Sequential Processes. Prentice Hall International, 1985.
5. D. Kozen. Results on the propositional mu-calculus. Theoretical Computer Science, 27:333-354, 1983
6. Y. S. Kwong. On reduction of asynchronous systems. Theoretical Computer Science, 5:25-50, 1977.
7. Kim G. Larsen and Bent Thomsen. A modal process logic. In Proceedings of the Third Annual Symposium on Logic in Computer Science, 1988.
8. Kim G. Larsen and Liu Xinxin. Compositionality through an operational semantics of contexts. In Proceedings of ICALP ‘90, 1990.
9. Robin Milner. Communication and Concurrency. Prentice Hall International, 1989.
10. Davide Sangiorgi and Robin Milner. The problem of “weak bisimulation up to”. In Proceedings of CONCUR ‘92, 1992.
11. Joseph Sifakis. Property preserving homomorphisms of transition systems. In Logics of Programs. Springer Verlag, 1983. Lecture Notes in Computer Science, volume 164.
12. Colin Stirling. An introduction to modal and temporal logics for CCS. In A. Yonezawa and T. Ito, editors, Concurrency: Theory, Language, and Architecture. Springer Verlag, 1989. Lecture Notes in Computer Science, volume 391.
13. Colin Stirling. Temporal logics for CCS. In J.W. de Bakker, W.-P. de Roever, and G. Rozenberg, editors, Linear Time, Branching Time and Partial Order in Logics and Models. Springer Verlag, 1989. Lecture Notes in Computer Science, volume 354.