SCOPUS 정보 검색 플랫폼

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

Volumn 1563, Issue , 1999, Pages 510-520

A modal fixpoint logic with chop

(1) Müller Olm, Markus a

a TU DORTMUND UNIVERSITY (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

CALCULATIONS; CONTEXT FREE LANGUAGES; TEMPORAL LOGIC;

BISIMULATIONS; CHOP OPERATORS; CONTEXT-FREE PROCESS; FINITE MODEL PROPERTY; FINITE STATE PROCESS; MODAL MU CALCULUS; PREDICATE TRANSFORMERS; SATISFIABILITY;

COMPUTER CIRCUITS;

EID: 84957101257 PISSN: 03029743 EISSN: 16113349 Source Type: Book Series
DOI: 10.1007/3-540-49116-3_48 Document Type: Conference Paper

Times cited : (42)

References (17)

1
- 0021870594
- Algebra of communicating processes with abstraction
- J. A. Bergstra and J. W. Klop. Algebra of communicating processes with abstraction. Theoretical Computer Science, 37:77-121, 1985.
- (1985) Theoretical Computer Science , vol.37 , pp. 77-121
- Bergstra, J.A.¹ Klop, J.W.²

2
- 0003363352
- More infinite results
- O. Burkart and J. Esparza. More infinite results. ENTCS, 6, 1997. URL: http://www.elsevier.nl/locate/entcs/volume6.html.
- (1997) ENTCS , vol.6
- Burkart, O.¹ Esparza, J.²

3
- 84951123519
- Model checking the full modal mu-calculus for infinite sequential processes
- LNCS, Springer-Verlag
- O. Burkart and B. Steffen. Model checking the full modal mu-calculus for infinite sequential processes. In ICALP '97, LNCS 1256, 419-429. Springer-Verlag, 1997.
- (1997) ICALP '97 , vol.1256 , pp. 419-429
- Burkart, O.¹ Steffen, B.²

4
- 0026944928
- On the regular structure of prefix rewriting
- D. Caucal. On the regular structure of prefix rewriting. Theoretical Computer Science, 106:61-86, 1992.
- (1992) Theoretical Computer Science , vol.106 , pp. 61-86
- Caucal, D.¹

5
- 84947440701
- Containment of regular languages in non-regular timing diagram languages is decidable
- LNCS, Springer-Verlag
- K. Fisler. Containment of regular languages in non-regular timing diagram languages is decidable. In CAV'97, LNCS 1254. Springer-Verlag, 1997.
- (1997) CAV'97 , vol.1254
- Fisler, K.¹

6
- 0000788107
- Undecidable equivalences for basic process algebra
- J. F. Groote and H. Hüttel. Undecidable equivalences for basic process algebra. Information and Computation, 115(2):354-371, 1994.
- (1994) Information and Computation , vol.115 , Issue.2 , pp. 354-371
- Groote, J.F.¹ Hüttel, H.²

7
- 0003620778
- Addison-Wesley
- J. E. Hopcroft and J. D. Ullman. Introduction to Automata Theory, Languages and Computation. Addison-Wesley, 1979.
- (1979) Introduction to Automata Theory, Languages and Computation
- Hopcroft, J.E.¹ Ullman, J.D.²

8
- 49049126479
- Results on the propositional mu-calculus
- D. Kozen. Results on the propositional mu-calculus. Theoretical Computer Science, 27:333-354, 1983.
- (1983) Theoretical Computer Science , vol.27 , pp. 333-354
- Kozen, D.¹

9
- 0040859656
- A finite model theorem for the propositional mu-calculus
- D. Kozen. A finite model theorem for the propositional mu-calculus. Studia Logica, 47:233-241, 1988.
- (1988) Studia Logica , vol.47 , pp. 233-241
- Kozen, D.¹

10
- 84957798874
- Modal mu-calculus, model checking and Gauss elimination
- LNCS, Springer-Verlag
- A. Mader. Modal mu-calculus, model checking and Gauss elimination. In TACAS'95, LNCS 1019, 72-88. Springer-Verlag, 1995.
- (1995) TACAS'95 , vol.1019 , pp. 72-88
- Mader, A.¹

11
- 0003954103
- Prentice Hall
- R. Milner. Communication and Concurrency. Prentice Hall, 1989.
- (1989) Communication and Concurrency
- Milner, R.¹

12
- 84955565828
- Infinite results
- LNCS, Springer-Verlag
- F. Moller. Infinite results. In CONCUR'96, LNCS 1119, 195-216. Springer-Verlag, 1996.
- (1996) CONCUR'96 , vol.1119 , pp. 195-216
- Moller, F.¹

13
- 0022020113
- A temporal logic for multi-level reasoning about hardware
- B. Moszkowski. A temporal logic for multi-level reasoning about hardware. IEEE Computer, 18(2):10-19, 1985.
- (1985) IEEE Computer , vol.18 , Issue.2 , pp. 10-19
- Moszkowski, B.¹

14
- 0037801420
- Derivation of characteristic formulae
- M. Müller-Olm. Derivation of characteristic formulae. ENTCS, 18, 1998. URL: http://www.elsevier.nl/locate/entcs/volume18.html.
- (1998) ENTCS
- Müller-Olm, M.¹

15
- 0000223296
- LNCS, Springer-Verlag
- D. M. R. Park. Concurrency and automata on infinite sequences. In LNCS 154, 561-572. Springer-Verlag, 1981.
- (1981) Concurrency and Automata on infinite Sequences , vol.154 , pp. 561-572
- Park, D.M.R.¹

16
- 0001422438
- Characteristic formulae for processes with divergence
- B. Steffen and A. Ingólfsdóttir. Characteristic formulae for processes with divergence. Information and Computation, 110(1):149-163, 1994.
- (1994) Information and Computation , vol.110 , Issue.1 , pp. 149-163
- Ste, B.¹ Ingólfsdóttir, A.²

17
- 0026285434
- A calculus of durations
- Zhou Chaochen, C. A. R. Hoare, and A. P. Ravn. A calculus of durations. Information Processing Letters, 40(5):269-276, 1991.
- (1991) Information Processing Letters , vol.40 , Issue.5 , pp. 269-276
- Chaochen, Z.¹ Hoare, C.A.R.² Ravn, A.P.³

* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.