Towards automata for branching time and partial order

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

Volumn 1119, Issue , 1996, Pages 611-626

  Huhn, Michaela ^a   Niebert, Peter ^a  

^a UNIVERSITY OF HILDESHEIM   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTABILITY AND DECIDABILITY; FORESTRY; MODEL CHECKING; PETRI NETS;

ASYNCHRONOUS AUTOMATA; EMPTINESS PROBLEM; GENERALISATION; MAZURKIEWICZ TRACES; NONDETERMINISTIC CHOICE; PARTIAL ORDER LOGIC; PARTIAL ORDER REDUCTIONS; PETRI NET THEORIES;

AUTOMATA THEORY;

EID: 84955595048     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-61604-7_79     Document Type: Conference Paper

References (21)

1. Orna Bernholtz, Moshe Y. Vardi, and Pierre Wolper. An automata-theoretic approach to branching-time model checking. In CAV 94, LNCS 818, pp 142-153, 1994.
2. Jörg Desel and Javier Esparza. Free choice Petri nets. Cambridge tracts in theoretical computer science 40, Cambridge University Press, 1995.
3. M.R. Garey and D.S. Johnson. Computers and Intractability. Freeman, NY 1979.
4. H.J. Genrich and K. Lautenbach and P.S. Thiagarajan. Elements of general net theory. In Net Theory and Applications, LNCS 84, pages 21-159, 1979.
5. R. Gerth, R. Kuiper, D. Peled, and W. Penezek. A partial order approach to branching time logic model checking. In Israeli Symp. on Theoretical Comp. Sci., 1995.
6. Michaela Huhn and Peter Niebert. Towards automata for branching time and partial order. Report HIB 16/ 96. Institute for Informatics, Univ. Hildesheim. 1996.
7. Ruurd Kuiper and Wojciech Penczek. Traces and Logic. In V. Diekert and G. Rozenberg (eds.): The Book of Traces, World Scientific, Singapore, 1995, 307-390
8. Antoni Mazurkiewicz. Basic notions of trace theory. LNCS 354, pp 285-363, 1988
9. Madhavan Mukund and P. S. Thiagarajan. An axiomatisation of well branching prime event structures. Internal Report TCS-90-2, Inst. of Mathematical Sciences, SPIC Science Foundation, Madras 600 113, India, September 1990.
10. Peter Niebert and Wojciech Penczek. On the connection of partial order logics and partial order reduction methods. Report 95-15, TU Eindhoven, CS Dept, 1995.
11. M. Nielsen and G. Winskel. Models for concurrency, in S. Abramsky, D.M Gabbay, T.S.E. Maibaum (eds.): Handbook of Logic in Computer Science, Volume 4 Semantic Modelling, pages 1-148, Oxford University Press 1995.
12. Doron Peled. All from one, one for all: on model checking using representatives. In Computer Aided Verification, LNCS 697, 1993.
13. Wojciech Penczek. On undecidability of propositional temporal logics on trace systems. Information Processing Letters 43, 147-153, 1992
14. B. Rozoy and P.S. Thiagarajan. Event structures and trace monoids, Theoretical Computer Science 91, 285-313, 1991.
15. E.W. Stark. Concurrent transition systems. In Theoretical Computer Science 64: 221-269,1989.
16. P.S. Thiagarajan. A trace based extension of Linear Time Temporal Logic. In Proc. of the 9th annual IEEE Symposium on Logic in Computer Science (LICS), 1994.
17. P.S. Thiagarajan. A trace consistent subset of PTL. In CONCUR’95, LNCS 962, 1995.
18. Wolfgang Thomas. Automata on infinite objects. In J. v. Leeuwen (ed.), Handbook of Theoretical Computer Science, vd. B, ch. 4, pages 133-191. Elsevier, 1990.
19. Moshe Y. Vardi and Pierre Wolper. An automata-theoretic approach to automatic program verification. In 1st IEEE Syrup. Logic in Comp. Sci. (LICS), p. 332-344, 1986.
20. Glynn Winskel. Event structures. In Advances in Petri Nets, LNCS 255, 1987.
21. Wieslaw Zielonka. Safe executions of recognisable trace languages by asynchronous automata. In Logic at Botik, LNCS 363, pages 278-289, 1989.