Modal specifications

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

Volumn 407 LNCS, Issue , 1990, Pages 232-246

  Larsen, Kim Guldstrand ^a  

^a AALBORG UNIVERSITY   (Denmark)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

BISIMULATIONS; LOGICAL CHARACTERIZATION; LOGICAL FORMULAS; OPERATIONAL INTERPRETATION; PROCESS ALGEBRAS; REFINEMENT ORDERINGS;

SPECIFICATIONS;

EID: 85008979790     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-52148-8_19     Document Type: Conference Paper

References (28)

1. S. Abramsky: Observation Equivalence as a Testing Equivalence, TCS, 1987.
2. Lecompte, Madelaine, Vergamini: A UTO: A Verification System for Parallel and Communicating Processes, INRIA, Sophia-Antipolis, 1988.
3. G. Boudol: Grafical Specifications, unpublished note, 1989.
4. Cleaveland, Parrow, Steffen: The Concurrency Workbench, University of Edinburgh.
5. S. Graf and J. Sifakis: A Logic for the Description of Non-deterministic Programs and Their Properties, Information and Control, vol 68, no 1-3, 1986.
6. Groote, Vaandrager: Structured Operational Semantics and Bisimulation as a Congruence, 1989.
7. M. Hennessy and R. Milner: Algebraic Laws for Nondeterminism and Concurrency, Journal of the Association for computing Machinery, pp. 137-161, 1985.
8. M. Hillerstrom: Verification of CCS -processes, Master-Thesis, Aalborg University Center, 1987.
9. S. Holmström: Reasoing about CCS agents using Hennessy-Milner logic extended with fixed points, unpublished paper, 1987.
10. Hüttel, Larsen: The use of Static Constructs in A Modal Process Logic, to be presented at Logic at Botik’89, USSR.
11. Ingolfsdottir, Godskesen, Zeeberg: Master Thesis, Aalborg University, 1987.
12. Kannellakis, Smolka: CCS Expressions, finite state processes, and three problems of equivalence, 1983. To appear in Information and Computation.
13. Larsen, Kim. G and Bent Thomsen: A Modal Process Logic, in Proceedings of Third Annual symposium on Logic in Computer Science, Edinburgh, 1988.
14. K. G. Larsen: A Context Dependent Bisimulation between Processes, Ph. D Thesis, Edinburgh University, 1986.
15. K. G. Larsen: A Context Dependent Bisimulation between Processes, Theoretical Computer Science 49, 1987.
16. Larsen, Kim G.: Proof Systems for Hennessy-Milner Logic with Recursion, in: CAAP 88, Springer Lecture Notes in Computer Science 299, 1988. (Extended version to appear in Theoretical Computer Science, North-Holland).
17. Larsen: Arguing about Membership of Maximal Fixedpoints, future paper.
18. K. G. Larsen and R. Milner: Verifying a Protocol Using Relativized Bisimulation, in Proceedings of ICALP’87, LNCS 267.
19. Larsen, Skou: Bisimulation Through Probabilistic Testing, Proceedings of ACM POPL’89.
20. R. Milner: Calculus of Communicating Systems, LNCS 92.
21. R. Milner: Calculi for Synchrony and Asynchrony, Theoretical Computer Science 25, 1983.
22. Paige, Tarjan: Three Partition Refinement Algorithms, SIAM J. Comput., vol. 16, no. 6, 1987.
23. D. Park: Concurrency and automata on infinite sequences, Proc. 5th GI Conf., LNCS 104, 1981.
24. G. Plotkin: A Structural Approach to Operational Semantics, Tech. Rep., DAIMI FN-19, Computer Sc., Aarhus University, Denmark, 1981.
25. R. de Simone: Higher-level synchronising devices in MEIJE-CCS, TCS 37, 1985.
26. B. STeffen: Characteristic Formulae, Edinburgh University, 1989.
27. A. Taski: A Lattice-Theoretical Fixpoint Theorem and Its applications, Pacific Journal of Math. 5, 1955.
28. Larsen, Skou: TAU: Theories for Parallel Systems, their Automation and Usage, Aalborg University Center, 1987.