D.M.R. Park. Concurrency and automata on infinite sequences. In P. Deussen, editor, 5 th GI Conference, pages 167--183. LNCS 104, Springer-Verlag, 1981. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
First 50 documents Next 50
Process Algebra with Language Matching - Jos Van Wamel (Correct)
No context found.
D.M.R. Park. Concurrency and automata on infinite sequences. In P. Deussen, editor, 5 th GI Conference, pages 167--183. LNCS 104, Springer-Verlag, 1981.
Bisimulation is two-way simulation - Bergstra And Gh (Correct)
No context found.
D. Park. Concurrency and automata on infinite sequences. In Proceedings 5th GI Conference, 167--183. LNCS 104, Springer Verlag, 1981.
The Algebra of - Finite State Processes (Correct)
No context found.
D. M. R. Park. Concurrency and automata on infinite sequences. In Proc. 5th G.I. Conference, LNCS 104. Springer-Verlag, 1981.
The Algebra of - Finite State Processes (Correct)
No context found.
D. M. R. Park. Concurrency and automata on infinite sequences. In Proc. 5th G.I. Conference, LNCS 104. Springer-Verlag, 1981.
Math. Struct. in Comp. Science (2004), vol. 14, pp.. - Cambridge University Press (Correct)
No context found.
Park, D. M. R. (1989) Concurrency and automata on infinite sequences. In: Deussen, P. (ed.) In: Proc. of the 5th GI Conference. Springer-Verlag Lecture Notes in Computer Science 104 167--183. Plotkin, G. D. (1976) A powerdomain construction. SIAM Journal on Computing 5 452--487.
A Naïve Time Analysis and its Theory of Cost Equivalence - Sands (1995) (Correct)
No context found.
D. Park. Concurrency and automata on infinite sequences. In 5th GI Conference on Theoretical Computer Science. LNCS 104, Springer Verlag, 1980.
From Sequential Programs to Multi-Tier Applications by.. - Neubauer, Thiemann (2005) (Correct)
No context found.
D. Park. Concurrency and automata on infinite sequences. In Proceedings of the 5th GI-Conference on Theoretical Computer Science, number 104 in Lecture Notes in Computer Science, pages 167--1183. Springer-Verlag, 1981.
Generating Test Cases for Infinite System Specifications - Stefan Heymer And (Correct)
No context found.
D. Park. Concurrency and Automata on Infinite Sequences. In P. Deussen, editor, Proceedings 5th GI Conference, pages 167--183. Lecture Notes in Computer Science 104, Springer-Verlag, 1981.
Observational Congruences for Dynamically Reconfigurable .. - Bruni, Montanari.. (Correct)
No context found.
D. Park, Concurrency and automata on infinite sequences, in: Proceedings of Fifth G-I Conference, Vol. 104 of Lect. Notes in Comput. Sci., Springer Verlag, 1981, pp. 167--183.
Propositional Temporal Logics and - Equivalences Ursula Goltz (Correct)
No context found.
: Park, D., Concurrency and automata on infinite sequences, 5th Conf. on Theoretical Comp. Sci., LNCS 104, 1981.
Bigraphs for Petri nets - Milner (2004) (7 citations) (Correct)
No context found.
Park, D., Concurrency and automata on infinite sequences. In LNCS 104, Springer Verlag (1980).
A Logical Viewpoint on Process-Algebraic Quotients - Kucera, Esparza (1999) (2 citations) (Correct)
No context found.
D.M.R. Park. Concurrency and automata on infinite sequences. In Proceedings 5 GI Conference, volume 104 of LNCS, pages 167--183. Springer, 1981.
Transition systems, link graphs and Petri nets - Leifer, Milner (2004) (2 citations) (Correct)
No context found.
Park, D.M.R. (1980), Concurrency and automata on infinite sequences. LNCS 104, Springer Verlag.
On the Complexity of the linear-time μ-calculus for Petri Nets - Habermehl (Correct)
No context found.
D. Park. Concurrency and Automata on Infinite Sequences. In 5th GI-Conference on Theoretical Computer Science. 1981. LNCS 104.
History Dependent Automata - Montanari, Pistore (2001) (3 citations) (Correct)
No context found.
D. Park. Concurrency and Automata on Infinite Sequences, volume 104 of LNCS. Springer Verlag, 1980.
Verifying a Sliding Window Protocol in μCRL - Fokkink, Groote, Pang, Badban, .. (2004) (Correct)
No context found.
D.M.R. Park. Concurrency and automata on infinite sequences. In Proc. 5th GI Conference, LNCS 104, pp. 167--183. Springer, 1981.
The Concurrency Column - Aceto (Correct)
No context found.
D.M.R. Park. Concurrency and automata on infinite sequences. In Proceedings of 5th GI Conference, LNCS 104, pages 167-183. Springer-Verlag, 1981.
A Logical Framework For Reasoning About Logical Specifications - Tiu (2004) (2 citations) (Correct)
No context found.
D. Park. Concurrency and automata on infinite sequences. In P. Deussen, editor, Theoretical Computer Science: 5th GI-Conference, volume 104 of Lecture Notes in Computer Science, pages 167--183, Karlsruhe, Germany, 1981. SV.
Congruence for SOS with Data - Mohammadreza Mousavi Michel (Correct)
No context found.
David M.R. Park. Concurrency and automata on infinite sequences. In Proceedings of 5th GI Conference, volume 104 of Lecture Notes in Computer Science, pages 167--183. SpringerVerlag, Berlin, Germany, 1981.
Comparing Refinements for Failure and Bisimulation Semantics - Eshuis, Fokkinga (2001) (Correct)
No context found.
D. Park. Concurrency and automata on infinite sequences. In Peter Deussen, editor, 5th GI-Conference, volume 104 of Lecture Notes in Computer Science, pages 167--183, Berlin, Heidelberg, and New York, 1981. Springer-Verlag.
Vopp: A verification tool for probabilistic processes - Martin (1993) (1 citation) (Correct)
No context found.
D. Park. Concurrency and automata on infinite sequences. In Deussen, editor, Proc. 5 GI Conf. of Theoretical Computer Science, volume 104 of Lecture Notes in Computer Science, pages 245--251, 1981.
Topo-distance: Measuring the Difference between Spatial Patterns - Aiello (2000) (Correct)
No context found.
D. Park. Concurrency and Automata on Infinite Sequences. In Proceedings of the 5th GI Conference, pages 167--183, Berlin, 1981. Springer Verlag.
Model-Driven Software Verification - Holzmann, Joshi (2004) (Correct)
No context found.
D. Park, Concurrencyand automata on infinite sequences. In 5th GI-Conference on Theoretical Computer Science,pp. 167-183. Springer,1981.
An Elementary Bisimulation Decision Procedure for Arbitrary.. - Burkart, Caucal (1994) (17 citations) (Correct)
No context found.
D. Park. Concurrency and Automata on Infinite Sequences. In 5th GI Conference, LNCS 104, pages 167--183. Springer, 1981. 25
Verifying Semantic Relations in SPIN - Hakan Erdogmus Institute (2 citations) (Correct)
No context found.
D. M. R. Park. Concurrency and automata for infinite sequences. In Proceedings of 5th GI Conference, number 104 in Lecture Notes in Computer Science. Springer-Verlag, 1981.
First 50 documents Next 50
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC