52 results on '"Klop, J. W."'
Search Results
2. Transfinite reductions in orthogonal term rewriting systems
3. Origin tracking in term rewriting
4. Term rewriting systems with priorities
5. Decidability of bisimulation equivalence for processes generating context-free languages
6. ACPτ a universal axiom system for process specification
7. Process theory based on bisimulation semantics
8. Linear time and branching time semantics for recursion with merge
9. Verification of an alternating bit protocol by means of process algebra protocol
10. Process algebra with asynchronous communication mechanisms
11. Algebraic specifications for parametrized data types with minimal parameter and target algebras
12. A formalized proof system for total correctness of while programs
13. Correctness of programs with function procedures : extended abstract
14. The algebra of recursively defined processes and the algebra of regular processes
15. Algebraic tools for system construction
16. On solvability by λI-terms
17. On the asynchronous nature of communication in concurrent logic languages: A fully abstract model based on sequences
18. Ideal specification formalism = expressivity + compositionality + decidability + testability + ...
19. Process algebra with a zero object
20. Effective solutions to domain equations an approach to effective denotational semantics
21. Priority as extremal probability
22. Convergence of iteration systems
23. An axiomatization of Lamport's temporal logic of actions
24. Real-time behaviour of asynchronous agents
25. Delay-insensitive circuits: An algebraic approach to their design
26. On the compositional checking of validity
27. A synchronous calculus of relative frequency
28. Partial order logics for elementary net systems: State- and event-approaches
29. Factorization of finite state machines under observational equivalence
30. Proving termination of communicating programs
31. SCONE: A simple calculus of nets
32. Rewriting as a unified model of concurrency
33. Equivalences, congruences, and complete axiomatizations for probabilistic processes
34. A temporal calculus of communicating systems
35. Transition system specifications with negative premises
36. A new strategy for proving ω-completeness applied to process algebra
37. A programming logic for formal concurrent systems
38. CCSR: A calculus for communicating shared resources
39. The linear time - branching time spectrum
40. An implementation of a translational semantics for an imperative language
41. Superimposition for interacting processes
42. A temporal approach to algebraic specifications
43. A preorder for partial process specifications
44. Synthesis rules for Petri nets, and how they lead to new results
45. The need for headers: An impossibility result for communication over unreliable channels
46. Reduction and design of well-behaved concurrent systems
47. Back and forth bisimulations
48. Verifying temporal properties of processes
49. Testing equivalences and fully abstract models for probabilistic processes
50. Let's make models
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.