73,741 Hits in 2.7 sec

Modelling and Refining Hybrid Systems in Event-B and Rodin [chapter]

Michael Butler, Jean-Raymond Abrial, Richard Banach
2016 From Action Systems to Distributed Systems  
The original actions of the abstract event are retained in the refinement event, and additional actions are added to reset wl m to be a point interval on the current time and change the pump status to  ...  The function is monotonically increasing in Interval 1 and monotonically decreasing in Interval 2.  ... 
doi:10.1201/b20053-5 fatcat:c3iw7bhlnrgu7ektvt7yqt3r7a

Monotone Temporal Planning: Tractability, Extensions and Applications [chapter]

Martin C. Cooper, Frédéric Maris, Pierre Régnier
2014 Lecture Notes in Computer Science  
This is an author-deposited version published in : Eprints ID : 13079 To link to this article : Abstract.  ...  Firstly, by supposing that each fluent (fact) can be established by at most one action, we can quickly determine which actions are necessary in any plan.  ...  The class of temporal planning problems described in Theorem 1 which also have the property that all fluents can be detected as monotone* by Lemma 2 constitutes a tractable class that can be detected and  ... 
doi:10.1007/978-3-319-10428-7_69 fatcat:hvzyj2jn3zauhjg722g3go2lfm

Privacy Preserving Controller Synthesis via Belief Abstraction [article]

Bo Wu, Hai Lin
2018 arXiv   pre-print
To guarantee the privacy requirement, we propose to abstract the belief space whose dynamics is shown to be mixed monotone where efficient abstraction algorithm exists.  ...  Privacy is a crucial concern in many systems in addition to their given tasks.  ...  A switched system is mixed monotone if it is mixed monotone for each mode (action) a ∈ A.  ... 
arXiv:1802.10051v2 fatcat:wthj7g3ou5bcpklikf6bhoxyua

Compositional Abstractions for Long-Run Properties of Stochastic Systems

Michael J.A. Smith
2011 2011 Eighth International Conference on Quantitative Evaluation of SysTems  
We compare the precision and state space reduction with results obtained by computing long-run averages on a CTMDP-based abstraction.  ...  Because of this, we look for abstraction techniques that allow us to analyse a smaller model that safely bounds the properties of the original.  ...  ACKNOWLEDGEMENTS We would like to thank Jane Hillston, Joost-Pieter Katoen, and Perdita Stevens for their many insightful comments and feedback on the work in this paper.  ... 
doi:10.1109/qest.2011.37 dblp:conf/qest/Smith11a fatcat:xv2hzmd7tnbxvft2lgrftmvsk4

Conservative approximations for heterogeneous design

Roberto Passerone, Jerry R. Burch, Alberto L. Sangiovanni-Vincentelli
2004 Proceedings of the fourth ACM international conference on Embedded software - EMSOFT '04  
In this paper, we focus in particular on abstraction and refinement relationships in the form of conservative approximations.  ...  If no agent in É can be represented exactly, then © is abstracting away too much information to be of much use for verification.  ...  In that case, in fact, the order of the actions can be preserved, and the verification problem can be addressed using abstract interpretations.  ... 
doi:10.1145/1017753.1017781 dblp:conf/emsoft/PasseroneBS04 fatcat:mlvxqarl4rhlxm2aqpsmux76my

Verifying Visibility-Based Weak Consistency [chapter]

Siddharth Krishna, Michael Emmi, Constantin Enea, Dejan Jovanović
2020 Lecture Notes in Computer Science  
In this work we develop a methodology for proving that concurrent object implementations adhere to weak-consistency specifications.  ...  While some concurrentobject operations are designed to behave atomically, each witnessing the atomic effects of predecessors in a linearization order, others forego such strong consistency to avoid complex  ...  the abstract-execution actions.  ... 
doi:10.1007/978-3-030-44914-8_11 fatcat:np7yq4pkcfgirj3e75c3za224e

Verifying Visibility-Based Weak Consistency [article]

Siddharth Krishna, Michael Emmi, Constantin Enea, Dejan Jovanovic
2019 arXiv   pre-print
In this work we develop a methodology for proving that concurrent object implementations adhere to weak-consistency specifications.  ...  While some concurrent-object operations are designed to behave atomically, each witnessing the atomic effects of predecessors in a linearization order, others forego such strong consistency to avoid complex  ...  include the abstract-execution actions.  ... 
arXiv:1911.01508v1 fatcat:xeu4aoa4szbupchvodlzcaoyay

A compiler approach to scalable concurrent-program design

Ian Foster, Stephen Taylor
1994 ACM Transactions on Programming Languages and Systems  
In particular, Steve Tuecke is responsible for the development of the PCN emulator, Sharon Brunett and Dong Lin for the compilation transformations and compiler development, and Bob Olson for the network  ...  A shared monotone variable can be used to both communicate values and synchronize actions.  ...  Y pln( 0 0 ) } } Y default -> In this form, G i is a PCN guard action, A, is an atomic action, and Pi is a process ExpressionJ Removal.  ... 
doi:10.1145/177492.177612 fatcat:dn33yrxc2zcgfokql32l62u7ay

The failure of failures in a paradigm for asynchronous communication [chapter]

F. S. Boer, J. N. Kok, C. Palamidessi, J. J. M. M. Rutten
1991 Lecture Notes in Computer Science  
Suspension is modelled by an action being undefined in a state.  ...  In particular, we show that our model is more abstract than the standard failure set semantics (that is known to be fully abstract for the classical synchronous paradigms).  ...  P r o o f By the requirement of (strong) idempotency of atomic actions. We are now ready to prove the full abstraction of I) for monotonic interpretations.  ... 
doi:10.1007/3-540-54430-5_84 fatcat:clsjuzby4nbonar65cm3nnaqi4

Forthcoming papers

1996 Artificial Intelligence  
We formalize the use of primary effects in planning and present a criterion for selecting useful primary effects, which guarantees efficiency and completeness.  ...  Automatically selecting and using primary effects in planning: theory and experiments The use of primary effects of operators is an effective approach to improving the efficiency of planning.  ...  We show that non-monotonic abductive systems preserve a partial version of rational monotonicity and in fact are very similar to rational relations.  ... 
doi:10.1016/s0004-3702(96)90016-8 fatcat:heev5wzgnbenfpinwk52u2dfzi

An Algebraic Approach to Refinement with Fair Choice

Emil Sekerinski
2008 Electronical Notes in Theoretical Computer Science  
In the analysis and design of concurrent systems, it can be useful to assume fairness among processes. Action systems model a process by a set of atomic actions.  ...  The novelty is the algebraic style in which the fair choice operator is defined and in which formal reasoning is carried out; it avoids an appeal to the operational understanding of fairness.  ...  abstraction action and that the introduced actions are stuttering actions.  ... 
doi:10.1016/j.entcs.2008.06.004 fatcat:32eso55asffnhkbsihtxdw5m7u

Delay-Bounded Scheduling Without Delay! (Extended Technical Report) [article]

Andrew Johnson, Thomas Wahl
2021 arXiv   pre-print
Our technique, however, never statically constructs an abstract parametric program; it only requires some abstract-states set to be closed under certain actions, thus eliminating the dependence on the  ...  Previous work has established that, for non-trivial concurrency routines, predicate abstraction induces a highly complex abstract program semantics.  ...  A key ingredient of the technique proposed in this paper is to identify actions of the program executed by a thread with the property that the abstract successor of an abstract state under such an action  ... 
arXiv:2105.07277v1 fatcat:j4dysqt3uve2tlkw47pe67i33a

Page 65 of American Mathematical Society. Bulletin of the American Mathematical Society Vol. 50, Issue 1 [page]

1944 American Mathematical Society. Bulletin of the American Mathematical Society  
It is also shown that the orbits of the components of S—A are influenced by the periodicity in A and hence a pattern is formed for the action of T(S) =S in the large. (Received October 21, 1943.) 52.  ...  In particular it is shown that the limit mapping of any uniformly convergent sequence of quasi- monotone mappings of A onto B is itself quasi-monotone.  ... 

Page 475 of Linguistics and Language Behavior Abstracts: LLBA Vol. 28, Issue 2 [page]

1994 Linguistics and Language Behavior Abstracts: LLBA  
In experiment 1 (N = 16), causative actions were paired with synchronous actions. In experi- ment 2 (N = 52), the same synchronous actions were paired with contact actions.  ...  Annesser Mur- ray (Copyright 1994, Sociological Abstracts, Inc., all rights reserved.) 9402132 Philip, William & De Villiers, Jill (U Massachusetts, Amherst 01003), Monotonicity and the Acquisition of  ... 

Using an inductive approach for definition making: Monotonicity and boundedness of sequences

Deonarain Brijlall, Aneshkumar Maharaj
2009 Pythagoras  
The study investigated fourth–year students' construction of the definitions of monotonicity and boundedness of sequences, at the Edgewood Campus of the University of KwaZulu –Natal in South Africa.  ...  These students specialised in the teaching of mathematics in the Further Education and Training (FET) (Grades 10 to 12) school curriculum.  ...  Monotonicity Theoretical basis Piaget, cited in Bowie (2000) , expanded and deliberated on the notion of reflective abstraction which has the following two components: (1) A projection of existing knowledge  ... 
doi:10.4102/pythagoras.v0i70.40 fatcat:qcigav6u6bdo3hh46lzysht3g4
« Previous Showing results 1 — 15 out of 73,741 results