Possible worlds for process algebras

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

Volumn 1466, Issue , 1998, Pages 179-193

  Veglioni, Simone ^a   De Nicola, Rocco ^b  

^a UNIVERSITY OF OXFORD   (United Kingdom)

^b UNIVERSITY OF FLORENCE   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

SPECIFICATIONS;

BASIC PROCESS ALGEBRA; MODEL SPACES; NON DETERMINISM; NON-DETERMINISTIC PROCESS; POSSIBLE WORLDS; PREORDERS; PROCESS ALGEBRAS; UNDERSPECIFICATION;

ALGEBRA;

EID: 84945891900     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0055623     Document Type: Conference Paper

References (14)

1. J. Baeten and W. Weijland. Process Algebra, volume 18 of Cambridge Tracts in Theoretical Computer Science. Cambridge University Press, 1990.
2. J.A. Bergstra, J.W. Klop, and E.R. Olderog. Failures without chaos: A new process semantics for fair abstraction. In M.Wirsing, editor, Formal Description of Programming Concepts -III, pages 77-103. North-Holland, 1987.
3. R. De Nicola and M. Hennessy. Testing equivalences for processes. Theoretical Computer Science, 34: 83-133, 1984.
4. R. De Nicola and M. Hennessy. CCS without T’s. In Proceedings, TAPSOFT’87, Theory And Practice of SOFTware development, pages 138-252. Springer-Verlag LNCS 249, 1987.
5. Hartmut Ehrig and Bernd Mahr. Fundamentals of Algebraic Specification 1: Equations and Initial Semantics. Springer-Verlag, 1985.
6. R.J. van Glabbeek. Comparative Concurrency Semantics and Refinement of Actions. PhD thesis, Free University, Amsterdam, 1990. Second edition available as CWI tract 109, CWI, Amsterdam 1996.
7. Joseph A. Goguen. Theorem Proving and Algebra. MIT, 1997.
8. Joseph A. Goguen and Grant Malcolm. A hidden agenda. Technical Report CS97-538, UCSD, 1997. To appear in Theoretical Computer Science.
9. M. Hennessy. Algebraic theory of processes. MIT Press, 1988.
10. Fernando Orejas, Marisa Navarro, and Ana Snchez. Algebraic implementation of abstract data-types: a survey of concepts and new compositionality results. Mathematical Structures in Computer Science, 6(1), 1996.
11. Donald Sannella and Andrzej Tarlecki. Toward formal development of programs from algebraic specifications. Acta Informatica, 25: 233-281, 1988.
12. Rob van Glabbeek. The linear time - branching time spectrum. In J. Baeten and J. Klop, editors, Proceedings, CONCUR’90, Amsterdam, pages 278-297. Springer-Verlag Lecture Notes in Computer Science, 458, 1990.
13. Simone Veglioni. Integrating Static and Dynamic aspects in the specification of Open Object-based Distributed Systems. Phi thesis, Programming Research Group, Oxford University, 1997. Available on ftp://ftp. univaq. it/pub/users/veglioni/thesis. ps.
14. Simone Veglioni. Objects as Abstract Machines. In Proceedings, Formal Methods for Open, Object-based, Distributed Systems, 2nd International Conference, FMOODS’97. Chapman & Hall, 1997.