U. Montanari and M. Pistore. An introduction to history dependent automata. In Second Workshop on Higher-Order Operational Techniques in Semantics (HOOTS II), volume 10 of ENTCS. Elsevier, 1998. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Model Checking Dynamic Allocation and Deallocation - Distefano, Rensin, Katoen (2002) (3 citations) (Correct)
....system is dealing at run time with activities like allocation and deallocation of resources (memory, channels, processes, etc. Though there are now calculi (such as the # calculus [19] that can express the generation of fresh names, as well as models (such as history dependent automata [20]) that can describe both the birth and the death of entities, what has been missing so far is a logic where these concepts are captured as primitives; a logic that should be as fundamental to reasoning about dynamic allocation as standard propositional logic is to reasoning about a fixed state ....
....born. In addition, ATL has the standard LTL temporal operators (although a branching time version with CTL temporal operators can be defined in a rather similar way) The logic is interpreted over so called high level allocational Buchi automata (HABA) which extend history dependent automata [20] with a predicate for the unboundedness of (the number of entities in) a state, and with a (generalized) Buchi acceptance condition. As for history dependent automata, a crucial point is that entity identity is local to a state. Correspondence between the identity of the same entity in two ....
[Article contains additional citation context not shown here]
U. Montanari and M. Pistore. An introduction to history-dependent automata. Electr. Notes in Th. Comp. Sci., 10, 1998.
Model Checking Birth And Death - Distefano, Rensink, Katoen (2002) (Correct)
....deallocation (birth and death) of entities. This is especially true if the number of entities is not known beforehand, or even unbounded. Though there are now calculi (such as the # calculus [15] that can express the generation of fresh names, as well as models (such as History Dependent automata [16]) that can describe both the birth and the death of entities, what has been missing so far is a logic where these concepts are captured as primitives; a logic that should be as fundamental to reasoning about dynamic allocation as standard propositional logic is to reasoning about a fixed state ....
....of x, provided that x is alive. iv) A predicate x new to express that the entity referred to by x is fresh, i.e. newly born. In addition, has the standard LTL temporal operators. The logic is interpreted over high level allocational B uchi automata (HABA) which extend HD automata [16] with a predicate for the unboundedness of (the number of entities in) a state, and with a (generalised) Buchi acceptance condition. Together with the logic the main contribution of this paper is that the model checking problem for is shown to be decidable. In particular, we present a ....
[Article contains additional citation context not shown here]
U. Montanari, M. Pistore. An introduction to history-dependent automata. Electr. Notes in Th. Comp. Sci., 10, 1998.
Model Checking Dynamic Allocation and Deallocation - Distefano, Rensink, Katoen (2002) (3 citations) (Correct)
....computer system is dealing at run time with activities like allocation and deallocation of resources (memory, channels, processes, etc. Though there are now calculi (such as the # calculus [19] that can express the generation of fresh names, as well as models (such as history dependent automata [20]) that can describe both the birth and the death of entities, what has been missing so far is a logic where these concepts are captured as primitives; a logic that should be as fundamental to reasoning about dynamic allocation as standard propositional logic is to reasoning about a fixed state ....
....born. In addition, ATL has the standard LTL temporal operators (although a branching time version with CTL temporal operators can be defined in a rather similar way) The logic is interpreted over so called high level allocational Buchi automata (HABA) which extend history dependent automata [20] with a predicate for the unboundedness of (the number of entities in) a state, and with a (generalized) Buchi acceptance condition. As for history dependent automata, a crucial point is that entity identity is local to a state. Correspondence between the identity of the same entity in two ....
[Article contains additional citation context not shown here]
U. Montanari and M. Pistore. An introduction to history-dependent automata. Electr. Notes in Th. Comp. Sci., 10, 1998.
Models for Name-Passing Processes: Interleaving and Causal.. - Cattani, Sewell (2000) (3 citations) (Correct)
.... bisimulation) we focus on intensional models, over which a number of equivalences can be de ned (though we give results only for bisimulation) The literature contains also testing based models [Hen96, BDN95] The precise relationships with these and other models de ned in the literature e.g. [MP98, MP95, BG95, JJ95] requires further work. In [CS00] we begin the study of three applications. Firstly, we believe our structures may form a useful basis for calculus interleaving and partial order model checking, via notions of nitely generable N LTS and N LATS. We de ne the former precisely. Secondly, N LTS ....
U. Montanari and M. Pistore. An introduction to history dependent automata. In Second Workshop on Higher-Order Operational Techniques in Semantics (HOOTS II), volume 10 of ENTCS. Elsevier, 1998.
History Dependent Automata - Montanari, Pistore (2001) (3 citations) Self-citation (Montanari Pistore) (Correct)
No context found.
U. Montanari and M. Pistore. An introduction to history dependent automata. In Proc. Second Workshop on Higher-Order Operational Techniques in Semantics (HOOTS II), volume 10 of ENTCS. Elsevier, 1998.
Compositional SOS and Beyond: A Coalgebraic View of Open.. - Corradini, Heckel.. (2001) (7 citations) Self-citation (Montanari) (Correct)
....the free functor (which exists under mild conditions on C) mapping the category of structured transition systems on C to the category of internal categories in C actually corresponds to de ning the operational semantics of these models of computation. Another related example is described in [25], where the notion of bisimilarity of [18] based on spans of open maps, initially de ned for ordinary transition systems, is automatically lifted to certain history dependent transition systems which model name generation and name passing as necessary for the calculus. In general, internal ....
U. Montanari and M. Pistore. An introduction to history dependent automata. In Proc. of Second Workshop on Higher-Order Operational Techniques in Semantics (HOOTS II), Electronic Notes of TCS, volume 10, 1998.
Models & Languages for Open Distributed Systems - Montanari (1999) Self-citation (Montanari) (Correct)
....causality and locality information, Petri nets equipped with history preserving bisimulation, and asynchronous calculus. Correspondingly, to make the approach independent from the actual syntax, certain classes of automata, called History Dependent Automata (HD automata) have been introduced [43], which are able to allocate and garbage collect names. Without the latter, even simple agents could generate in nite state systems. An extended format able to represent HD automata has been de ned within the veri cation environment JACK developed in Pisa at IEICNR, and a tool able to translate ....
Montanari, U. and Pistore, M. An Introduction to History Dependent Automata. In: Andrew Gordon, Andrew Pitts and Carolyn Talcott, Eds, Second Workshop on Higher-Order Operational Techniques in Semantics (HOOTS II), ENTCS, Vol. 10, 1998.
Models for Name-Passing Processes: Interleaving and Causal.. - Cattani, Sewell (2000) (4 citations) (Correct)
No context found.
U. Montanari and M. Pistore. An introduction to history dependent automata. In Second Workshop on Higher-Order Operational Techniques in Semantics (HOOTS II), volume 10 of ENTCS. Elsevier, 1998.
Safety and Liveness in Concurrent Pointer Programs - Distefano, Katoen, Rensink (Correct)
No context found.
U. Montanari and M. Pistore. An introduction to history-dependent automata. ENTCS 10, 1998.
A Parametric Model for the Analysis of Mobile Ambients - Distefano (2005) (Correct)
No context found.
U. Montanari and M. Pistore. An introduction to history-dependent automata. In A. Gordon, A. Pitts, and C. Talcott, editors, HOOTS II,vol. 10 of ENTCS. Elsevier Science Publishers, 1997.
Model Checking for Dynamic Allocation and Deallocation.. - Distefano, Rensink.. (2002) (3 citations) (Correct)
No context found.
U. Montanari and M. Pistore. An introduction to history-dependent automata. Electr. Notes in Th. Comp. Sci., 10, 1998.
Model Checking Dynamic Allocation and Deallocation - Distefano, Rensink, Katoen (2002) (3 citations) (Correct)
No context found.
U. Montanari and M. Pistore. An introduction to history-dependent automata. Electr. Notes in Th. Comp. Sci., 10, 1998.
Parametric model checking for Mobile Ambients - Distefano (Correct)
No context found.
U. Montanari and M. Pistore. An introduction to history-dependent automata. In A. Gordon, A. Pitts, and C. Talcott, editors, HOOTS II,volume10ofENTCS. Elsevier Science Publishers, 1997.
Who is Pointing When to Whom? On the Automated.. - Distefano, Katoen.. (2004) (Correct)
No context found.
U. Montanari and M. Pistore. An introduction to history-dependent automata. ENTCS 10, 1998.
Model Checking For Dynamic - Allocation And Deallocation (Correct)
No context found.
U. Montanari and M. Pistore. An introduction to history-dependent automata. Electr. Notes in Th. Comp. Sci., 10, 1998.
Model Checking Dynamic Allocation and Deallocation - Dino Distefano Arend (2002) (3 citations) (Correct)
No context found.
U. Montanari and M. Pistore. An introduction to history-dependent automata. Electr. Notes in Th. Comp. Sci., 10, 1998.
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