R. Milner. An algebraic definition of simulation between programs. In Proc. 2nd International Joint Conference on Artificial Intelligence, pages 481--489. British Computer Society, September 1971. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
First 50 documents Next 50
From Trace Sets to Modal-Transition Systems by Stepwise Abstract.. - Schmidt (2001) (1 citation) (Correct)
....definitions. Definition 27 For abstraction relation, R Sigma Theta Sigma A , a model, M Sigma , is R simulated by A Sigma A iff for all s 2 Sigma, a 2 Sigma A , 2 M, s R a and (0) s imply there exists 2 A such that (0) a and R The notion of simulation is the usual one [32]: when s R a, then every trace in M starting at s is reproduced by a corresponding trace in A that starts at a. This property implies universal soundness: Theorem 28 If R Sigma Theta Sigma A reflects atomic properties (that is, s R a implies I(s) IA A , then for all a 2 Sigma A ; s 2 ....
R. Milner. An algebraic definition of simulation between programs. In Proc. 2nd International Joint Conf. on Artificial Intelligence. British Computer Society, 1971. 52
An Application of Abstraction and Induction Techniques to.. - Miller, Calder (2003) (Correct)
....the model ## , namely # # and # # .These reduced structures are constructed via data abstraction [22] and (by a result proved in [23] any property that can be shown to hold for a reduced model, holds for the concrete model. It can be shown that for any # # # there is a simulation preorder [24] between # and # #### . Similarly, for all # # #,forall # # ###### ##, there is a simulation preorder between # and # ### # . For models # and # , # ## # implies that ### #. Proof of theorem 1 follows. When # # is property 4, we can show, using model checking, that # #### ## # # and ....
R. Milner, "An algebraic definition of simulation between programs," in Proceedings of the 2nd International Joint Conference on Artificial Intelligence, 1971, pp. 481--489.
Characteristic Formulae for Timed Automata - Aceto.. (2000) (1 citation) (Correct)
....the logic L # that, like those in the untimed setting and unlike that o#ered in [19] yield formulae whose size is linear with respect to that of the timed automaton they characterize. We present characteristic formula constructions for timed bisimilarity [28] timed versions of the simulation [21] and ready simulation [5, 20] preorders and for the faster than preorder [23] In particular, the characteristic formula construction for timed bisimilarity improves upon that o#ered in [19] In addition, since, if B is a deterministic timed automaton, checking whether the set of timed traces ....
R. Milner, An algebraic definition of simulation between programs, in Proceedings 2 Joint Conference on Artificial Intelligence, William Kaufmann, 1971, pp. 481--489. Also available as Report No. CS-205, Computer Science Department, Stanford University.
Invariants, Bisimulations and the Correctness of Coalgebraic.. - Jacobs (1997) (Correct)
....of a class in which one can store elements from A, which reappear at some unspecified later stage 5 Refinements with invariant and bisimulation proofs A refinement establishes a relation between two specifications. Usually one says that an abstract specification is refined by a concrete one, see [9, 21, 4] (and also Section 2) This means that the behaviour that is specified in the abstract specification can be realised by the concrete specification. The latter often contains more details about how to realise this behaviour. Typically, it is more deterministic (i.e. less underspecified) than the ....
R. Milner. An algebraic definition of simulation between programs. In Sec. Int. Joint Conf. on Artificial Intelligence, pages 481--489. British Comp. Soc. Press, London, 1971.
Abstraction as the Key for Invariant Verification - Bensalem, Graf, Lakhnech (Correct)
....in stating whether the concrete fixed point is contained or contains a given property. This is the question of the correctness of the applied abstraction. There exist two closely related frameworks for developing abstractions and proving their correctness. The framework of simulation [Par81,Mil71] is about structural relation between abstract and concrete transition systems, representing the step relation of programs by means of an abstraction relation between abstract and concrete sets of states, where each concrete (set of transitions) transition must be simulatable by an abstract ....
....technique for pushing further the limits of model checking: given a program and a property to be verified, find a (simpler) abstract program such that the satisfaction on the abstract program implies the satisfaction on the initial program, called concrete program. Simulation as defined by Milner [Mil71] yields an appropriate preorder. In section 4.2, we introduce the notions of abstraction and property preservation and show that, given some invariant, a weaker notion of simulation, imposing no requirement on the successors of states outside the invariant, preserves the same set of properties. ....
[Article contains additional citation context not shown here]
R. Milner. An algebraic definition of simulation between programs. In Proc. Second Int. Joint Conf. on Artificial Intelligence, pages 481--489. BCS, 1971.
An Application of Abstraction and Induction Techniques to.. - Miller, Calder (Correct)
....the model MN , namely M N and M N . These reduced structures are constructed via data abstraction [22] and (by a result proved in [23] any property that can be shown to hold for a reduced model, holds for the concrete model. It can be shown that for any N 3 there is a simulation preorder [24] between M and M Abs0 . Similarly, for all i 1, for all N max(i; 4) there is a simulation preorder between M and M Abs i . For models M and M , M j= implies that M j= Proof of theorem 1 follows. When i is property 4, we can show, using model checking, that M Abs0 j= 0 ....
R. Milner, "An algebraic definition of simulation between programs," in Proceedings of the 2nd International Joint Conference on Artificial Intelligence, 1971, pp. 481--489.
Verification of Open Systems - Orna Kupferman Hebrew (Correct)
No context found.
R. Milner. An algebraic definition of simulation between programs. In Proc. 2nd International Joint Conference on Artificial Intelligence, pages 481--489. British Computer Society, September 1971.
Games in System Design and Verification - Thomas Henzinger Epfl (Correct)
No context found.
R. Milner. An algebraic definition of simulation between programs. In International Joint Conference on Artificial Intelligence, pages 481--489. Kaufmann, 1971. 3
Treewidth in Verification: Local vs. Global - Ferrara, Pan, Vardi (Correct)
No context found.
R. Milner. An algebraic definition of simulation between programs. In Proc. 2nd Int. Joint Conf. on Artif. Int., pages 481--489. British Computer Society, September 1971.
Safety Verification of Hybrid Systems by Constraint.. - Ratschan, She (Correct)
No context found.
R. Milner. An algebraic definition of simulation between programs. In Proc. of the 2nd International Joint Conference on Artificial Intelligence, pages 481--489, 1971.
Three-Valued Abstractions of Games: Uncertainty, but.. - de Alfaro, Godefroid, .. (2004) (Correct)
No context found.
R. Milner. An algebraic definition of simulation between programs. In Second International Joint Conference on Artificial Intelligence, pages 481--489. The British Computer Society, 1971.
Three-Valued Abstractions of Games: Uncertainty, but.. - de Alfaro, Godefroid, .. (2004) (Correct)
No context found.
R. Milner. An algebraic definition of simulation between programs. In Second International Joint Conference on Artificial Intelligence, pages 481--489. The British Computer Society, 1971.
Equivalence-Based Reductions and checking for preorders - Bustan (2002) (Correct)
No context found.
R. Milner. An algebraic definition of simulation between programs. In Proc. of the 2nd International Joint Conferences on Artificial Intelligence (IJCAI), pages 481--489, London, UK, 1971.
Behavioral Substitutability in Component Frameworks: A.. - Moisan, Ressouche.. (2003) (3 citations) (Correct)
No context found.
R. Milner. An algebraic definition of simulation between programs. Proc. IJCAI, pages 481--489, 1971.
Constructing Büchi Automata from Linear Temporal Logic Using.. - Fritz (2003) (Correct)
No context found.
R. Milner. An algebraic definition of simulation between programs. In D. C. Cooper, editor, Proc. of the 2nd Int. Joint Conf. on Artificial Intelligence, pp. 481--489, London, UK, September 1971. William Kaufmann. ISBN 0-934613-34-6. 37
Toward Component-Oriented Formal Software Development.. - Bidoit, Sannella.. (Correct)
No context found.
R. Milner. An algebraic definition of simulation between programs. Proc. 2nd Intl. Joint Conf. on Artificial Intelligence, London, 481--489 (1971).
Toward Component-Oriented Formal Software Development.. - Bidoit, Sannella.. (2004) (Correct)
No context found.
R. Milner. An algebraic definition of simulation between programs. Proc. 2nd Intl. Joint Conf. on Artificial Intelligence, London, 481--489 (1971).
Universal Extensions to Simulate Specifications - Wim Hesselink Th (2004) (Correct)
No context found.
R. Milner. An algebraic definition of simulation between programs. In Proc. 2nd Int. Joint Conf. on Artificial Intelligence, pages 481--489. British Comp. Soc., 1971.
Interface Automata - de Alfaro, Henzinger (2001) (22 citations) (Correct)
No context found.
R. Milner. An algebraic definition of simulation between programs. In Proc. 2nd International Joint Conference on Artificial Intelligence, pages 481--489. The British Computer Society, 1971.
Pre-logical Relations - Honsell, Sannella (1999) (12 citations) (Correct)
No context found.
R. Milner. An algebraic definition of simulation between programs. Proc. 2nd Intl. Joint Conf. on Artificial Intelligence. British Computer Society, 481--489 (1971).
The Early Search for Tractable Ways of Reasoning About Programs - Jones (2003) (Correct)
No context found.
R. Milner. An algebraic definition of simulation between programs. Technical Report CS-205, Computer Science Dept, Stanford University, February 1971.
State Space Reductions for Alternating Büchi Automata.. - Fritz, Wilke (2002) (Correct)
No context found.
Robin Milner. An algebraic definition of simulation between programs. In D. C. Cooper, editor, Proc. of the 2nd Int. Joint Conf. on Artificial Intelligence, pp. 481--489, London, UK, September 1971. William Kaufmann.
Synchronous and Bidirectional Component Interfaces - Chakrabarti, de Alfaro.. (2002) (2 citations) (Correct)
No context found.
R. Milner. An algebraic definition of simulation between programs. In Proc. of Second Int. Joint Conf. on Artificial Intelligence, pages 481--489. The British Computer Society, 1971.
Proof Principles for Datatypes with Iterated Recursion - Hensel, Jacobs (1997) (10 citations) (Correct)
No context found.
R. Milner. An algebraic definition of simulation between programs. In Sec. Int. Joint Conf. on Artificial Intelligence, pages 481--489. British Comp. Soc. Press, London, 1971.
2-Nested Simulation is not Finitely Equationally Axiomatizable - Aceto, al. (2000) (Correct)
No context found.
R. Milner, An algebraic definition of simulation between programs, in Proceedings 2nd Joint Conference on Artificial Intelligence, William Kaufmann, 1971, pp. 481-- 489.
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