-
4
-
-
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.1
Klop, J.W.2
-
11
-
-
0022706656
-
Automatic verification of finite-state concurrent systems using temporal logic specifications
-
E.M. Clarke, E.A. Emerson, and A.P. Sistla. Automatic verification of finite-state concurrent systems using temporal logic specifications. TOPLAS, 8(2), 1986.
-
(1986)
TOPLAS
, vol.8
, Issue.2
-
-
Clarke, E.M.1
Emerson, E.A.2
Sistla, A.P.3
-
17
-
-
0026189823
-
Actions speak louder than words: Proving bisimilarity for context-free processes
-
H. Hültel and C. Stirling. Actions speak louder than words: proving bisimilarity for context-free processes. Proceedings of Logic in Computer Science, 1991.
-
(1991)
Proceedings of Logic in Computer Science
-
-
Hültel, H.1
Stirling, C.2
-
18
-
-
85029445326
-
-
Department of Mathematics and Computer Science, Aalborg University, Presented at workshop on Automatic Methods for Finite State Systems, Grenoble, France, Juni 1989
-
K.G. Larsen, J.C. Godskesen and M. Zeeberg. Tav — tools for automatic verification — users manual. Technical Report R 89-19, Department of Mathematics and Computer Science, Aalborg University, 1989. Presented at workshop on Automatic Methods for Finite State Systems, Grenoble, France, Juni 1989.
-
(1989)
Tav — Tools for Automatic Verification — Users Manual. Technical Report R 89-19
-
-
Larsen, K.G.1
Godskesen, J.C.2
Zeeberg, M.3
-
19
-
-
85029440301
-
-
Lecture Notes In Computer Science, Springer Verlag, 140, 1982. in Proc. of International Colloquium on Algorithms, Languages and Programming
-
D. Kozen. Results on the propositional mu-calculus. Lecture Notes In Computer Science, Springer Verlag, 140, 1982. in Proc. of International Colloquium on Algorithms, Languages and Programming 1982.
-
(1982)
Results on the Propositional Mu-Calculus
-
-
Kozen, D.1
-
20
-
-
0022312586
-
A context dependent bisimulation between processes
-
K.G. Larsen. A context dependent bisimulation between processes. Theoretical Computer Science, 49, 1987.
-
(1987)
Theoretical Computer Science
, pp. 49
-
-
Larsen, K.G.1
-
21
-
-
0025430468
-
Proof systems for satisfiability in Hennessy-Milner logic with recursion
-
K.G. Larsen. Proof systems for satisfiability in Hennessy-Milner logic with recursion. Theoretical Computer Science, 72, 1990.
-
(1990)
Theoretical Computer Science
, pp. 72
-
-
Larsen, K.G.1
-
26
-
-
0003630836
-
-
of Lecture Notes In Computer Science, Springer Verlag. Springer Verlag
-
R. Milner. Calculus of Communicating Systems, volume 92 of Lecture Notes In Computer Science, Springer Verlag. Springer Verlag, 1980.
-
(1980)
Calculus of Communicating Systems
, vol.92
-
-
Milner, R.1
-
27
-
-
0001530725
-
Calculi for synchrony and asynchrony
-
R. Milner. Calculi for synchrony and asynchrony. Theoretical Computer Science, 25:267-310, 1983.
-
(1983)
Theoretical Computer Science
, vol.25
, pp. 267-310
-
-
Milner, R.1
-
29
-
-
85029439729
-
-
Lecture Notes In Computer Science, Springer Vertag, 104, 1981. Proceedings of 5th GI Conference
-
D. Park. Concurrency and automata on infinite sequences. Lecture Notes In Computer Science, Springer Vertag, 104, 1981. Proceedings of 5th GI Conference.
-
Concurrency and Automata on Infinite Sequences
-
-
Park, D.1
-
30
-
-
0024751090
-
Submodule construction as equation solving in CCS
-
J. Parrow. Submodule construction as equation solving in CCS. Theoretical Computer Science, 68, 1989.
-
(1989)
Theoretical Computer Science
, pp. 68
-
-
Parrow, J.1
-
32
-
-
85029455729
-
-
Lecture Notes In Computer Science, Springer Verlag, 194, 1985. Proceedings of 12th International Colloquium on Automata, Languages and Programming
-
A. Pnueli. Linear and branching structures in the semantics and logics of reactive systems. Lecture Notes In Computer Science, Springer Verlag, 194, 1985. Proceedings of 12th International Colloquium on Automata, Languages and Programming.
-
Linear and Branching Structures in the Semantics and Logics of Reactive Systems
-
-
Pnueli, A.1
-
33
-
-
0025432462
-
Ccs expressions, finite state processes, and three problems of equivalence
-
P.C. Kanellakis and S.A. Smolka. Ccs expressions, finite state processes, and three problems of equivalence. Information and Control, 86, 1990.
-
(1990)
Information and Control
, vol.86
-
-
Kanellakis, P.C.1
Smolka, S.A.2
-
34
-
-
0023566630
-
Three partition refinement algorithms
-
Paige and Tarjan
-
Paige and Tarjan. Three partition refinement algorithms. SIAM Journal of Computing, 16(6), 1987.
-
(1987)
SIAM Journal of Computing
, vol.16
, Issue.6
-
-
-
35
-
-
33847545816
-
-
Technical report, LGI-IMAG
-
J.L. Rixchier, C. Rodriguez, J. Sifakis, and J. Voiron. Xesar: a tool for protocol validation. users’ guide. Technical report, LGI-IMAG, 1987.
-
(1987)
Xesar: A Tool for Protocol Validation. users’ Guide
-
-
Rixchier, J.L.1
Rodriguez, C.2
Sifakis, J.3
Voiron, J.4
-
38
-
-
84972541021
-
A lattice-theoretical fixpoint theorem and its applications
-
A. Tarski. A lattice-theoretical fixpoint theorem and its applications. Pacific Journal of Math., 5, 1955.
-
(1955)
Pacific Journal of Math
, pp. 5
-
-
Tarski, A.1
-
39
-
-
85029412687
-
-
Lecture Notes In Computer Science, Springer Verlag, In Proceedings of International Colloquium on Algorithms, Languages and Programming 19’89
-
G. Winskel. Model checking the modal nu-calculus. Lecture Notes In Computer Science, Springer Verlag, 372, 1989. In Proceedings of International Colloquium on Algorithms, Languages and Programming 19’89.
-
(1989)
Model Checking the Modal Nu-Calculus
, vol.372
-
-
Winskel, G.1
|