Gotowa bibliografia na temat „Parameterised systems”
Utwórz poprawne odniesienie w stylach APA, MLA, Chicago, Harvard i wielu innych
Spis treści
Zobacz listy aktualnych artykułów, książek, rozpraw, streszczeń i innych źródeł naukowych na temat „Parameterised systems”.
Przycisk „Dodaj do bibliografii” jest dostępny obok każdej pracy w bibliografii. Użyj go – a my automatycznie utworzymy odniesienie bibliograficzne do wybranej pracy w stylu cytowania, którego potrzebujesz: APA, MLA, Harvard, Chicago, Vancouver itp.
Możesz również pobrać pełny tekst publikacji naukowej w formacie „.pdf” i przeczytać adnotację do pracy online, jeśli odpowiednie parametry są dostępne w metadanych.
Artykuły w czasopismach na temat "Parameterised systems"
Groote, Jan Friso, i Tim A. C. Willemse. "Parameterised boolean equation systems". Theoretical Computer Science 343, nr 3 (październik 2005): 332–69. http://dx.doi.org/10.1016/j.tcs.2005.06.016.
Pełny tekst źródłaOrzan, Simona, i Tim A. C. Willemse. "Invariants for Parameterised Boolean Equation Systems". Theoretical Computer Science 411, nr 11-13 (marzec 2010): 1338–71. http://dx.doi.org/10.1016/j.tcs.2009.11.001.
Pełny tekst źródłaKouvaros, Panagiotis, i Alessio Lomuscio. "Parameterised verification for multi-agent systems". Artificial Intelligence 234 (maj 2016): 152–89. http://dx.doi.org/10.1016/j.artint.2016.01.008.
Pełny tekst źródłaPloeger, B., J. W. Wesselink i T. A. C. Willemse. "Verification of reactive systems via instantiation of Parameterised Boolean Equation Systems". Information and Computation 209, nr 4 (kwiecień 2011): 637–63. http://dx.doi.org/10.1016/j.ic.2010.11.025.
Pełny tekst źródłaNagae, Yutaro, i Masahiko Sakai. "Reduced Dependency Spaces for Existential Parameterised Boolean Equation Systems". Electronic Proceedings in Theoretical Computer Science 265 (16.02.2018): 67–81. http://dx.doi.org/10.4204/eptcs.265.6.
Pełny tekst źródłaYoo, S. J. "Adaptive control of non-linearly parameterised pure-feedback systems". IET Control Theory & Applications 6, nr 3 (2012): 467. http://dx.doi.org/10.1049/iet-cta.2011.0150.
Pełny tekst źródłaCalder, M., i A. Miller. "An automatic abstraction technique for verifying featured, parameterised systems". Theoretical Computer Science 404, nr 3 (wrzesień 2008): 235–55. http://dx.doi.org/10.1016/j.tcs.2008.03.034.
Pełny tekst źródłaTang, D. F., i S. Dobbie. "iGen 0.1: a program for the automated generation of models and parameterisations". Geoscientific Model Development 4, nr 3 (16.09.2011): 785–95. http://dx.doi.org/10.5194/gmd-4-785-2011.
Pełny tekst źródłaTang, D. F., i S. Dobbie. "iGen: a program for the automated generation of models and parameterisations". Geoscientific Model Development Discussions 4, nr 2 (8.04.2011): 843–68. http://dx.doi.org/10.5194/gmdd-4-843-2011.
Pełny tekst źródłaKant, Gijs, i Jaco van de Pol. "Efficient Instantiation of Parameterised Boolean Equation Systems to Parity Games". Electronic Proceedings in Theoretical Computer Science 99 (23.10.2012): 50–65. http://dx.doi.org/10.4204/eptcs.99.7.
Pełny tekst źródłaRozprawy doktorskie na temat "Parameterised systems"
Kouvaros, Panagiotis. "Parameterised verification for multi-agent systems". Thesis, Imperial College London, 2015. http://hdl.handle.net/10044/1/33793.
Pełny tekst źródłaHouhou, Sara. "Parameterised Verification from Formal Specifications of Information Systems". Electronic Thesis or Diss., Sorbonne université, 2021. http://www.theses.fr/2021SORUS421.
Pełny tekst źródłaBusiness process models verification is crucial to detect possible errors at design time, rather than at execution on business process engines. BPMN is the primary notation for business process modelling. It is an ISO standard, widely used both in education and in industry. The semantics of BPMN are however defined in a semi-formal way within the standard. This is why many works have tackled the definition of formal semantics for BPMN. In this thesis, we first provided a detailed study of the main works relating to the verification of BPMN models. This allowed us to identify several fragments of the notation which are often put aside in the work of formalization, such as the different models of communication, the temporal management, or the multi-instance character. These aspects are however crucial for the extension of the field of application of BPMN to frameworks such as the Internet of Things or the Factory of the Future. We then defined an approach for the verification of business process collaboration models that supports several of these perspectives, namely the different communication models and time constraints. For this, we have defined formal execution semantics, in terms of first-order logic, to the BPMN fragment taken into account. We then defined implementations of this semantics in the formal languages TLA + and Alloy. Finally, this enabled the models to be verified using tools dedicated to these formal languages. Our approach is supported by a tool, fbpmn, allowing the formal transformation of BPMN models to TLA + and Alloy, the verification of models, and the animation of counter-examples when the properties to be verified are not satisfied. This feedback is done directly on the initial BPMN model which makes the approach practicable in a context of use by non-specialists of formal methods. A web application has also been developed to make it even easier to apply our formal approach in an industrial setting. Our tools, our TLA + and Alloy formal semantics implementations, and our library of examples are open sources and available online
Graham, Douglas. "Parameterised verification of randomised distributed systems using state-based models". Thesis, Connect to e-thesis, 2008. http://theses.gla.ac.uk/95/.
Pełny tekst źródłaPh.D. thesis submitted to the Faculty of Information and Mathematical Sciences, University of Glasgow, 2008. Includes bibliographical references. Print version also available.
Lehaut, Mathieu. "Synthesis for parameterized systems". Electronic Thesis or Diss., Sorbonne université, 2020. http://www.theses.fr/2020SORUS341.
Pełny tekst źródłaIn this thesis, we study the synthesis problem for distributed systems where the number of participants is not known in advance and in which all participants interact with an uncontrollable environment. The synthesis problem is about automatically generating a program for such a system that would be correct by construction for a given specification, if such a program exist. We also study the closely related control problem, whose goal is generating a controller for a partially defined system such that all behaviors generated are correct with respect to the specification
Peach, Nigel G. "Bearings only tracking using a set of range parameterised extended Kalman filters". Thesis, University of Bath, 1997. https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.362303.
Pełny tekst źródłaMahata, Pritha. "Model Checking Parameterized Timed Systems". Doctoral thesis, Uppsala : Acta Universitatis Upsaliensis : Univ.-bibl. [distributör], 2005. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-4835.
Pełny tekst źródłaMalak, Richard J. Jr. "Using parameterized efficient sets to model alternatives for systems design decisions". Diss., Atlanta, Ga. : Georgia Institute of Technology, 2008. http://hdl.handle.net/1853/26697.
Pełny tekst źródłaCommittee Chair: Paredis, Christiaan J.J.; Committee Member: Bras, Bert; Committee Member: Choudhary, Ruchi; Committee Member: McGinnis, Leon; Committee Member: Rosen, David. Part of the SMARTech Electronic Thesis and Dissertation Collection.
Ben, Henda Noomene. "Infinite-state Stochastic and Parameterized Systems". Doctoral thesis, Uppsala University, Department of Information Technology, 2008. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-8915.
Pełny tekst źródłaA major current challenge consists in extending formal methods in order to handle infinite-state systems. Infiniteness stems from the fact that the system operates on unbounded data structure such as stacks, queues, clocks, integers; as well as parameterization.
Systems with unbounded data structure are natural models for reasoning about communication protocols, concurrent programs, real-time systems, etc. While parameterized systems are more suitable if the system consists of an arbitrary number of identical processes which is the case for cache coherence protocols, distributed algorithms and so forth.
In this thesis, we consider model checking problems for certain fundamental classes of probabilistic infinite-state systems, as well as the verification of safety properties in parameterized systems. First, we consider probabilistic systems with unbounded data structures. In particular, we study probabilistic extensions of Lossy Channel Systems (PLCS), Vector addition Systems with States (PVASS) and Noisy Turing Machine (PNTM). We show how we can describe the semantics of such models by infinite-state Markov chains; and then define certain abstract properties, which allow model checking several qualitative and quantitative problems.
Then, we consider parameterized systems and provide a method which allows checking safety for several classes that differ in the topologies (linear or tree) and the semantics (atomic or non-atomic). The method is based on deriving an over-approximation which allows the use of a symbolic backward reachability scheme. For each class, the over-approximation we define guarantees monotonicity of the induced approximate transition system with respect to an appropriate order. This property is convenient in the sense that it preserves upward closedness when computing sets of predecessors.
Kojić, Aleksandar M. 1974. "Parameter estimation in nonlinearly parameterized systems". Thesis, Massachusetts Institute of Technology, 1998. http://hdl.handle.net/1721.1/47637.
Pełny tekst źródłaRezine, Ahmed. "Parameterized Systems : Generalizing and Simplifying Automatic Verification". Doctoral thesis, Uppsala universitet, Avdelningen för datorteknik, 2008. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-8587.
Pełny tekst źródłaKsiążki na temat "Parameterised systems"
S, Kain John, i United States. National Aeronautics and Space Administration., red. Annual performance report for the period 15 April 1996 - 14 April 1997 for NASA grant no. NAG 5-2927 entitled evaluating and understanding parameterized convective processes and their role in the development of mesoscale precipitation systems. University Park, PA: Pennsylvania State University, Office of Sponsored Programs, 1997.
Znajdź pełny tekst źródłaNational Aeronautics and Space Administration (NASA) Staff. Evaluating and Understanding Parameterized Convective Processes and Their Role in the Development of Mesoscale Precipitation Systems. Independently Published, 2018.
Znajdź pełny tekst źródłaCzęści książek na temat "Parameterised systems"
Groote, Jan Friso, i Tim Willemse. "Parameterised Boolean Equation Systems". W CONCUR 2004 - Concurrency Theory, 308–24. Berlin, Heidelberg: Springer Berlin Heidelberg, 2004. http://dx.doi.org/10.1007/978-3-540-28644-8_20.
Pełny tekst źródłaAtif, Muhammad, i Jan Friso Groote. "Linear Processes and Parameterised BESs". W Studies in Systems, Decision and Control, 149–63. Cham: Springer International Publishing, 2023. http://dx.doi.org/10.1007/978-3-031-23008-0_8.
Pełny tekst źródłaOrzan, Simona, i Tim A. C. Willemse. "Invariants for Parameterised Boolean Equation Systems". W CONCUR 2008 - Concurrency Theory, 187–202. Berlin, Heidelberg: Springer Berlin Heidelberg, 2008. http://dx.doi.org/10.1007/978-3-540-85361-9_18.
Pełny tekst źródłaAştefănoaei, Lăcrămioara, Souha Ben Rayana, Saddek Bensalem, Marius Bozga i Jacques Combaz. "Compositional Verification of Parameterised Timed Systems". W Lecture Notes in Computer Science, 66–81. Cham: Springer International Publishing, 2015. http://dx.doi.org/10.1007/978-3-319-17524-9_6.
Pełny tekst źródłavan Dam, A., B. Ploeger i T. A. C. Willemse. "Instantiation for Parameterised Boolean Equation Systems". W Theoretical Aspects of Computing - ICTAC 2008, 440–54. Berlin, Heidelberg: Springer Berlin Heidelberg, 2008. http://dx.doi.org/10.1007/978-3-540-85762-4_30.
Pełny tekst źródłaSchneider, Eric, Elizabeth I. Sklar i Simon Parsons. "Evaluating Multi-Robot Teamwork in Parameterised Environments". W Towards Autonomous Robotic Systems, 301–13. Cham: Springer International Publishing, 2016. http://dx.doi.org/10.1007/978-3-319-40379-3_32.
Pełny tekst źródłaCranen, Sjoerd, Bas Luttik i Tim A. C. Willemse. "Proof Graphs for Parameterised Boolean Equation Systems". W CONCUR 2013 – Concurrency Theory, 470–84. Berlin, Heidelberg: Springer Berlin Heidelberg, 2013. http://dx.doi.org/10.1007/978-3-642-40184-8_33.
Pełny tekst źródłaTimm, Nils, i Heike Wehrheim. "On Symmetries and Spotlights – Verifying Parameterised Systems". W Formal Methods and Software Engineering, 534–48. Berlin, Heidelberg: Springer Berlin Heidelberg, 2010. http://dx.doi.org/10.1007/978-3-642-16901-4_35.
Pełny tekst źródłaKeiren, Jeroen J. A., Wieger Wesselink i Tim A. C. Willemse. "Liveness Analysis for Parameterised Boolean Equation Systems". W Automated Technology for Verification and Analysis, 219–34. Cham: Springer International Publishing, 2014. http://dx.doi.org/10.1007/978-3-319-11936-6_16.
Pełny tekst źródłaHerden, Olaf. "Parameterised Patterns for Conceptual Modelling of Data Warehouses". W Databases and Information Systems, 97–108. Dordrecht: Springer Netherlands, 2001. http://dx.doi.org/10.1007/978-94-015-9636-7_8.
Pełny tekst źródłaStreszczenia konferencji na temat "Parameterised systems"
Borve, Steinar. "Parameterised MRTD". W Electro-optical and Infrared Systems: Technology and Applications XX, redaktorzy Duncan L. Hickman, Helge Bürsing, Ove Steinvall i Gary W. Kamerman. SPIE, 2023. http://dx.doi.org/10.1117/12.2676696.
Pełny tekst źródłaSiirtola, Antti. "Refinement Checking Parameterised Quorum Systems". W 2017 17th International Conference on Application of Concurrency to System Design (ACSD). IEEE, 2017. http://dx.doi.org/10.1109/acsd.2017.15.
Pełny tekst źródłaBelardinelli, Francesco, Panagiotis Kouvaros i Alessio Lomuscio. "Parameterised Verification of Data-aware Multi-Agent Systems". W Twenty-Sixth International Joint Conference on Artificial Intelligence. California: International Joint Conferences on Artificial Intelligence Organization, 2017. http://dx.doi.org/10.24963/ijcai.2017/15.
Pełny tekst źródłaKouvaros, Panagiotis, i Alessio Lomuscio. "Verifying Fault-tolerance in Parameterised Multi-Agent Systems". W Twenty-Sixth International Joint Conference on Artificial Intelligence. California: International Joint Conferences on Artificial Intelligence Organization, 2017. http://dx.doi.org/10.24963/ijcai.2017/41.
Pełny tekst źródłaChen, Yu-Fang, Chih-Duo Hong, Anthony W. Lin i Philipp Rummer. "Learning to prove safety over parameterised concurrent systems". W 2017 Formal Methods in Computer-Aided Design (FMCAD). IEEE, 2017. http://dx.doi.org/10.23919/fmcad.2017.8102244.
Pełny tekst źródłaGallardo, María del Mar, Christophe Joubert i Pedro Merino. "Implementing Influence Analysis Using Parameterised Boolean Equation Systems". W Second International Symposium on Leveraging Applications of Formal Methods, Verification and Validation (isola 2006). IEEE, 2006. http://dx.doi.org/10.1109/isola.2006.26.
Pełny tekst źródłaAzzuhri, Saaidal R., Marius Portmann i Wee Lum Tan. "Evaluation of parameterised route repair in AODV". W 2010 4th International Conference on Signal Processing and Communication Systems (ICSPCS 2010). IEEE, 2010. http://dx.doi.org/10.1109/icspcs.2010.5709663.
Pełny tekst źródłaBuckley, Scott J. H., i Anthony M. Sloane. "A formalisation of parameterised reference attribute grammars". W SPLASH '17: Conference on Systems, Programming, Languages, and Applications: Software for Humanity. New York, NY, USA: ACM, 2017. http://dx.doi.org/10.1145/3136014.3136024.
Pełny tekst źródłaEstivill-Castro, Vladimir, i René Hexel. "Verifiable Parameterised Behaviour Models - For Robotic and Embedded Systems". W 6th International Conference on Model-Driven Engineering and Software Development. SCITEPRESS - Science and Technology Publications, 2018. http://dx.doi.org/10.5220/0006573903640371.
Pełny tekst źródłaOchsenschlager, Peter, i Roland Rieke. "Security Properties of Self-Similar Uniformly Parameterised Systems of Cooperations". W 2011 19th Euromicro International Conference on Parallel, Distributed and Network-Based Processing (PDP). IEEE, 2011. http://dx.doi.org/10.1109/pdp.2011.57.
Pełny tekst źródłaRaporty organizacyjne na temat "Parameterised systems"
Popova, Evgenija. On a Class of Parameterized Solutions to Interval Parametric Linear Systems. "Prof. Marin Drinov" Publishing House of Bulgarian Academy of Sciences, maj 2020. http://dx.doi.org/10.7546/crabs.2020.05.02.
Pełny tekst źródłaGrogan, Brandon Robert. The Development of a Parameterized Scatter Removal Algorithm for Nuclear Materials Identification System Imaging. Office of Scientific and Technical Information (OSTI), marzec 2010. http://dx.doi.org/10.2172/973840.
Pełny tekst źródłaGrogan, Brandon R. THE DEVELOPMENT OF A PARAMETERIZED SCATTER REMOVAL ALGORITHM FOR NUCLEAR MATERIALS IDENTIFICATION SYSTEM IMAGING. Office of Scientific and Technical Information (OSTI), maj 2010. http://dx.doi.org/10.2172/981787.
Pełny tekst źródłaChen, Yongzhou, Ammar Tahir i Radhika Mittal. Controlling Congestion via In-Network Content Adaptation. Illinois Center for Transportation, wrzesień 2022. http://dx.doi.org/10.36501/0197-9191/22-018.
Pełny tekst źródłaAgénor, Pierre-Richard, i Luiz A. Pereira da Silva. Cyclically Adjusted Provisions and Financial Stability. Inter-American Development Bank, maj 2016. http://dx.doi.org/10.18235/0011733.
Pełny tekst źródłaHamill, Daniel D., Jeremy J. Giovando, Chandler S. Engel, Travis A. Dahl i Michael D. Bartles. Application of a Radiation-Derived Temperature Index Model to the Willow Creek Watershed in Idaho, USA. U.S. Army Engineer Research and Development Center, sierpień 2021. http://dx.doi.org/10.21079/11681/41360.
Pełny tekst źródłaSelvaraju, Ragul, Hari Shankar i Hariharan Sankarasubramanian. Metamodel Generation for Frontal Crash Scenario of a Passenger Car. SAE International, wrzesień 2020. http://dx.doi.org/10.4271/2020-28-0504.
Pełny tekst źródłaSelvaraju, Ragul, Hari Shankar i Hariharan Sankarasubramanian. Metamodel Generation for Frontal Crash Scenario of a Passenger Car. SAE International, wrzesień 2020. http://dx.doi.org/10.4271/2020-28-0504.
Pełny tekst źródła