Se connecter

Bibliographies thématiques / Observable liveness

Sommaire

Articles de revues
Thèses
Chapitres de livres

Littérature scientifique sur le sujet « Observable liveness »

Auteur : Grafiati

Publié le 9 mars 2023

Mis à jour le 31 juillet 2025

Créez une référence correcte selon les styles APA, MLA, Chicago, Harvard et plusieurs autres

Choisissez une source :

Consultez les listes thématiques d’articles de revues, de livres, de thèses, de rapports de conférences et d’autres sources académiques sur le sujet « Observable liveness ».

À côté de chaque source dans la liste de références il y a un bouton « Ajouter à la bibliographie ». Cliquez sur ce bouton, et nous générerons automatiquement la référence bibliographique pour la source choisie selon votre style de citation préféré : APA, MLA, Harvard, Vancouver, Chicago, etc.

Vous pouvez aussi télécharger le texte intégral de la publication scolaire au format pdf et consulter son résumé en ligne lorsque ces informations sont inclues dans les métadonnées.

Articles de revues sur le sujet "Observable liveness"

1

Desel, Jörg, and Görkem Kılınç. "Observable liveness of Petri nets." Acta Informatica 52, no. 2-3 (2015): 153–74. http://dx.doi.org/10.1007/s00236-015-0218-1.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

2

GAY, SIMON J., and ANTÓNIO RAVARA. "Preface to special issue: behavioural types." Mathematical Structures in Computer Science 26, no. 2 (2014): 154–55. http://dx.doi.org/10.1017/s0960129514000152.

Texte intégral

Résumé :

This is the first part of a two-part special issue on Behavioural Types, which has its origin in a workshop we organized in April 2011, in Lisbon. The aim of the workshop was to bring together the active and expanding community of researchers using type-theoretic approaches to describe and analyse behavioural aspects of software. A particular concern of this field is the identification and description of structured communication in concurrent and distributed systems, but behavioural typing also addresses issues of liveness, fairness, deadlock-freedom, security, observable equivalence and types

Styles APA, Harvard, Vancouver, ISO, etc.

3

KAVI, KRISHNA M., FREDERICK T. SHELDON, and SHERMAN REED. "SPECIFICATION AND ANALYSIS OF REAL-TIME SYSTEMS USING CSP AND PETRI NETS." International Journal of Software Engineering and Knowledge Engineering 06, no. 02 (1996): 229–48. http://dx.doi.org/10.1142/s0218194096000119.

Texte intégral

Résumé :

Formal methods such as CSP (Communicating Sequential Processes) are widely used for reasoning about concurrency, communication, safety, and liveness issues. Some of these models have been extended to permit reasoning about real-time constraints. Yet, the research in formal specification and verification of complex systems has often ignored the specification of stochastic properties of the system under study. We are developing methods and tools to permit stochastic analyses of CSP-based specifications. Our basic objective is to evaluate candidate design specifications by converting formal syste

Styles APA, Harvard, Vancouver, ISO, etc.

4

Liu, Guanjun, and Changjun Jiang. "Observable liveness of Petri nets with controllable and observable transitions." Science China Information Sciences 60, no. 11 (2017). http://dx.doi.org/10.1007/s11432-016-0241-y.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

5

Chandra, Rohan, Vrushabh Zinage, Efstathios Bakolas, Peter Stone, and Joydeep Biswas. "Deadlock-free, safe, and decentralized multi-robot navigation in social mini-games via discrete-time control barrier functions." Autonomous Robots 49, no. 2 (2025). https://doi.org/10.1007/s10514-025-10194-8.

Texte intégral

Résumé :

Abstract We present an approach to ensure safe and deadlock-free navigation for decentralized multi-robot systems operating in constrained environments, including doorways and intersections. Although many solutions have been proposed that ensure safety and resolve deadlocks, optimally preventing deadlocks in a minimally invasive and decentralized fashion remains an open problem. We first formalize the objective as a non-cooperative, non-communicative, partially observable multi-robot navigation problem in constrained spaces with multiple conflicting agents, which we term as social mini-games.

Styles APA, Harvard, Vancouver, ISO, etc.

Thèses sur le sujet "Observable liveness"

1

KILINC, GORKEM. "Formal Notions of Non-interference and Liveness for Distributed Systems." Doctoral thesis, Università degli Studi di Milano-Bicocca, 2016. http://hdl.handle.net/10281/102363.

Texte intégral

Résumé :

La tesi propone una cornice formale per la vivezza e la sicurezza di sistemi distribuiti, e nuovi approcci per definire sistemi sicuri e 'serviceable'. Discute inoltre i relativi metodi di model-checking. Nel modellare sistemi distribuiti, classifichiamo i componenti di un sistema come 'service provider' o 'utenti'. Le azioni che occorrono sono osservabili dagli utenti o interne e nascoste. Un service provider deve garantire agli utenti un servizio affidabile e la protezione delle informazioni riservate. Per quanto riguarda la serviceability, la tesi esamina sistemi distribuiti nei quali u

Styles APA, Harvard, Vancouver, ISO, etc.

Chapitres de livres sur le sujet "Observable liveness"

1

Bernardinello, Luca, Görkem Kılınç, and Lucia Pomello. "Weak Observable Liveness and Infinite Games on Finite Graphs." In Application and Theory of Petri Nets and Concurrency. Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-57861-3_12.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

2

Bozzano, Marco, Alessandro Cimatti, Stefano Tonetta, and Viktoria Vozarova. "Searching for Ribbon-Shaped Paths in Fair Transition Systems." In Tools and Algorithms for the Construction and Analysis of Systems. Springer International Publishing, 2022. http://dx.doi.org/10.1007/978-3-030-99524-9_30.

Texte intégral

Résumé :

AbstractDiagnosability is a fundamental problem of partial observable systems in safety-critical design. Diagnosability verification checks if the observable part of system is sufficient to detect some faults. A counterexample to diagnosability may consist of infinitely many indistinguishable traces that differ in the occurrence of the fault. When the system under analysis is modeled as a Büchi automaton or finite-state Fair Transition System, this problem reduces to look for ribbon-shaped paths, i.e., fair paths with a loop in the middle.In this paper, we propose to solve the problem by exten

Styles APA, Harvard, Vancouver, ISO, etc.

3

Qin, Meng. "Deadlock Prevention for Automated Manufacturing Systems with Uncontrollable and Unobservable Transitions." In Formal Methods in Manufacturing Systems. IGI Global, 2013. http://dx.doi.org/10.4018/978-1-4666-4034-4.ch015.

Texte intégral

Résumé :

Many deadlock prevention policies on the basis of Petri nets dealing with deadlock problems in flexible manufacturing systems exist. However, most of them do not consider uncontrollable and unobservable transitions. This chapter solves deadlock problems in Petri nets with uncontrollable and unobservable transitions. A sufficient condition is developed to decide whether an existing deadlock prevention policy is still applicable in a Petri net with uncontrollable and unobservable transitions, when the policy itself is developed under the assumption that all the transitions are controllable and o

Styles APA, Harvard, Vancouver, ISO, etc.

Nous offrons des réductions sur tous les plans premium pour les auteurs dont les œuvres sont incluses dans des sélections littéraires thématiques. Contactez-nous pour obtenir un code promo unique!