Conjunction on processes: Full abstraction via ready-tree semantics

Theoretical Computer Science

Volumn 373, Issue 1-2, 2007, Pages 19-40

  Lüttgen, Gerald ^a   Vogler, Walter ^b  

^a UNIVERSITY OF YORK   (United Kingdom)

^b UNIVERSITY OF AUGSBURG   (Germany)

Author keywords

Conjunction; Consistency preorder; Full abstraction; Labelled transition system; Ready tree preorder; Ready tree semantics

Indexed keywords

ABSTRACTING; ALGEBRA; LINEAR ACCELERATORS; NUMERICAL METHODS;

FULL ABSTRACTION; LABELLED TRANSITION SYSTEM; READY-TREE PREORDER; READY-TREE SEMANTICS;

SEMANTICS;

EID: 33847400152     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2006.10.022     Document Type: Article

References (30)

1. Bergstra J., Ponse A., and Smolka S. Handbook of Process Algebra (2001), Elsevier Science
2. Pnueli A. The temporal logic of programs. FOCS '77 (1977), IEEE Computer Society Press 46-57
3. Cleaveland R., and Lüttgen G. A semantic theory for heterogeneous system design. FSTTCS 2000. LNCS vol. 1974 (2000), Springer-Verlag 312-324
4. Cleaveland R., and Lüttgen G. A logical process calculus. EXPRESS 2002. ENTCS vol. 68, 2 (2002), Elsevier Science
5. De Nicola R., and Hennessy M. Testing equivalences for processes. Theoret. Comput. Sci. 34 (1983) 83-133
6. van Glabbeek R. The linear time - branching time spectrum I. Handbook of Process Algebra (2001), Elsevier Science 3-99 (Chapter 1)
7. Veglioni S., and De Nicola R. Possible worlds for process algebras. CONCUR '98. LNCS vol. 1466 (1998), Springer-Verlag 179-193
8. van Glabbeek R. The linear time - branching time spectrum II. CONCUR '93. LNCS vol. 715 (1993), Springer-Verlag 66-81
9. Bloom B., Istrail S., and Meyer A. Bisimulation can't be traced. J. ACM 42 1 (1995) 232-268
10. Brookes S., Hoare C., and Roscoe A. A theory of communicating sequential processes. J. ACM 31 3 (1984) 560-599
11. Steen M., Bowman H., Derrick J., and Boiten E. Disjunction of LOTOS specifications. FORTE/PSTV '97. IFIP Conf. Proc. vol. 107 (1998), Chapman & Hall 177-192
12. Baeten J., Bergstra J., and Klop J. Ready-trace semantics for concrete process algebra with the priority operator. Comput. J. 30 6 (1987) 498-506
13. Larsen K., and Skou A. Bisimulation through probabilistic testing. Inform. and Comput. 94 1 (1991) 1-28
14. Miller S. Specifying the model logic of a flight guidance system in CoRE and SCR. FMSP '98 (1998), ACM Press 44-53
15. Boudol G., and Larsen K. Graphical versus logical specifications. Theoret. Comput. Sci. 106 1 (1992) 3-20
16. Dam M. Process-algebraic interpretations of positive linear and relevant logics. J. Log. Comput. 4 6 (1994) 939-973
17. Lamport L. The temporal logic of actions. ACM Trans. Program. Lang. Syst. 16 3 (1994) 872-923
18. Graf S., and Sifakis J. A logic for the description of non-deterministic programs and their properties. Inform. Control 68 1-3 (1986) 254-270
19. Abadi M., and Plotkin G. A logical view of composition. Theoret. Comput. Sci. 114 1 (1993) 3-30
20. Kurshan R. Computer-Aided Verification of Coordinating Processes: The Automata-Theoretic Approach (1994), Princeton Univ. Press
21. Bouajjani A., Graf S., and Sifakis J. A logic for the description of behaviours and properties of concurrent systems. REX Workshop. LNCS vol. 354 (1988), Springer-Verlag 398-410
22. Hennessy M., and Plotkin G. Finite conjunctive nondeterminism. Concurrency and Nets: Advances in Petri Nets (1987), Springer-Verlag 233-244
23. Holmström S. A refinement calculus for specifications in Hennessy-Milner logic with recursion. FAC 1 3 (1989) 242-272
24. Milner R. Communication and Concurrency (1989), Prentice Hall
25. Olderog E. Nets, Terms and Formulas. Cambridge Tracts in Theoretical Computer Science vol. 23 (1991), Cambridge Univ. Press
26. Larsen K., and Thomsen B. A modal process logic. LICS '88 (1988), IEEE Computer Society Press 203-210
27. Larsen K. Modal specifications. Automatic Verification Methods for Finite State Systems. LNCS vol. 407 (1989), Springer-Verlag 232-246
28. Larsen K., Steffen B., and Weise C. A constraint oriented proof methodology based on modal transition systems. TACAS '95. LNCS vol. 1019 (1995), Springer-Verlag 17-40
29. Steen M., Derrick J., Boiten E., and Bowman H. Consistency of partial process specifications. AMAST '98. LNCS vol. 1548 (1999), Springer-Verlag 248-262
30. Cleaveland R., and Sokolsky O. Equivalence and preorder checking for finite-state systems. Handbook of Process Algebra (2001), Elsevier Science 391-424