Propositional temporal logics and equivalences

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

Volumn 630 LNCS, Issue , 1992, Pages 222-236

  Goltz, Ursula ^a   Kuiper, Ruurd ^b   Penczek, Wojciech ^c  

^a GMD ^*  (Germany)

^b EINDHOVEN UNIVERSITY OF TECHNOLOGY   (Netherlands)

^c Warsaw School of Information and Management   (Poland)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER CIRCUITS;

ACTION REFINEMENT; BISIMULATIONS; BRANCHING TIME; EVENT STRUCTURES; HISTORY PRESERVING BISIMULATION; PARTIAL ORDER; TRACE EQUIVALENCE; TRANSITION SYSTEM;

TEMPORAL LOGIC;

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

References (27)

1. Boudol, G, Castellani, I., On the Semantics of Concurrency: Partial Orders and Transition Systems, Proc. of TAPSOFT 87, LNCS 249, 123-137, 1987.
2. Browne, M.C., Clarke, E.M., and Grumberg, O., Characteriwlng Finite Kripke Structures in Propositional Temporal Logic, TCS 59 (1-2), 115-131, 1988.
3. Clarke, E.M, Emerson, E.A., Sistla, A.P, Automatic Verification of Finite State Concurrent Systems Using Temporal Logic Specifications: A Practical Approach, 10th Annual ACM Symp. on Principles of Programming Languages, Austin, 117-126, 1983.
4. Emerson, E.A., Halpern, J.Y, Sometimes and “Not Never” Revisited: On Branching versus Linear Time Temporal Logic, Journal of the ACM 33 (1), 151-178, 1986.
5. Giabbeek, R. van. and Goltz, U.: Equivalence Notions for Concurrent Systems and Refinement of Actions, LNCS 379, pp. 237-248, 1989.
6. Goltz, U., Kuiper, R., Penczek, W., Propositional Temporal Logics and Equlvalenecsj deliverables of Esprit-BRA project 3096, 1992.
7. Hughes, G.E., Cresswcll, M.J., A Companion to Modal Logic, London, Methuen, 1984.
8. Katz, S., Paled, D., Interleaving Set Temporal Logic, 6th ACM Symposium on Principles of Distributed Computing, Vancouver Canada, 178-190, 1987.
9. Lamport, L., Sometime is sometimes not never, On the Temporal Logic of Programs, 7th ACM Syrup. on Princ. of Programming Logic, 174-185, 1980.
10. Loogen, R. and Goltz, U., Modelling Nondetermlnistic Concurrent Processes with Event Structures, Fundmenta Informaticac 14, No. 1, 39-73, 1991.
11. Manna, Z., Pnueli, A., The Anchored Version of the Temporal Framework, LNCS 354, 1988.
12. Manna, Z., Pnuell, A., Linear Time Temporal Logic, Springer Verlag, 1991.
13. Milner R., A Calculus for Communicating Systems, LNCS 92, 1980.
14. deNicols, R., Ferrarl, L., Observational Logics and Concurrency, Tech. Report, Dip. dl Informatica, Univ. of Piss, 1990.
15. deNicols, R., Vaandrager, F., Three Logics for Branching Bislmulation, Proc. of LICS, 1990.
16. deNieola, R., Montanari, U., and Vaandrager, F., Back and Forth Bisimulations, Proc. of CONCUR’90, 1990.
17. Nielsen, M., Plotkin, G., and Winskel, G., Petrl Nets, Event Structures and Domains, Part I, TCS 13, Vol. 1, pp. 85-109, 1981.
18. Nielsen, M., Rozenberg, G., and Thiagarajan, Transition Systems, Event Structures and Unfoldings, in preparation, 1991.
19. Park, D., Concurrency and automata on infinite sequences, 5th Conf. on Theoretical Comp. Sci., LNCS 104, 1981.
20. Penczek, W., A Concurrent Branching Time Temporal Logic, Proceedings of the Workshop on Computer Science Logic, Kalserslautern, LNCS 440, 331-354, 1990.
21. Rozoy, B., On Distributed Languages and Models for Distributed Computation, Technical Report 583, L.R.I., 1990.
22. Sinachopoulos, A., Partial Order Logics for Elementary Net Systems: State- and Event-approches, Proe. of CONCUR’90, 1990.
23. Stirling, C., Altrincham Workshop, LNCS 398, 1967.
24. Trakhtenbrot, B.A, Rablnovich, A., and Hirschfeld J., Nets of Processes, TR 97/86, Tel Aviv Univ., 1988.
25. Winskel, G., Event Structure Semantics for CCS and Related Languages, Proc. of ICALP, LNCS 224, 1982.
26. Winskel, G., An Introduction to Event Structures, LNCS 354, pp. 364-367, 1988.
27. Wolper, P., On the Relation of Programs and Computations to Models of Temporal Logic, Altrineham Workshop, LNCS 398, 75-123, 1987.