English
Related papers

Related papers: Non-interference analysis of bounded labeled Petri…

200 papers

Linear constraint transformation is an essential step to solve the forbidden state problem in Petri nets that contain uncontrollable transitions. This work studies the equivalent transformation from a legal-marking set to its…

Formal Languages and Automata Theory · Computer Science 2015-01-21 ShouGuang Wang , Dan You , MengChu Zhou , Carla Seatsu

Neural networks are increasingly deployed in real-world safety-critical domains such as autonomous driving, aircraft collision avoidance, and malware detection. However, these networks have been shown to often mispredict on inputs with…

Machine Learning · Computer Science 2018-11-09 Shiqi Wang , Kexin Pei , Justin Whitehouse , Junfeng Yang , Suman Jana

Quantum networks with multiple sources allow the observation of quantum nonlocality without inputs. Consequently, the incompatibility of measurements is not a necessity for observing quantum nonlocality when one has access to multiple…

Quantum Physics · Physics 2024-07-24 Shubhayan Sarkar

In this paper the correspondence between safe Petri nets and event structures, due to Nielsen, Plotkin and Winskel, is extended to arbitrary nets without self-loops, under the collective token interpretation. To this end we propose a more…

Logic in Computer Science · Computer Science 2009-12-22 R. J. van Glabbeek , G. D. Plotkin

We give an incremental, inductive (IC3) procedure to check coverability of well-structured transition systems. Our procedure generalizes the IC3 procedure for safety verification that has been successfully applied in finite-state hardware…

Logic in Computer Science · Computer Science 2013-02-25 Johannes Kloos , Rupak Majumdar , Filip Niksic , Ruzica Piskac

These lecture notes cover basic automata-theoretic concepts and logical formalisms for the modeling and verification of concurrent and distributed systems. Many of these concepts naturally extend the classical automata and logics over…

Logic in Computer Science · Computer Science 2021-10-19 Benedikt Bollig , Paul Gastin

Pollution from coal-fired power plants has been linked to substantial health and mortality burdens in the US. In recent decades, federal regulatory policies have spurred efforts to curb emissions through various actions, such as the…

We study detectability properties for labeled Petri nets and finite automata. We first study weak approximate detectability (WAD) that implies that there exists an infinite observed output sequence of the system such that each prefix of the…

Optimization and Control · Mathematics 2019-07-02 Kuize Zhang , Alessandro Giua

We consider the problem of safety verification and safety-aware controller synthesis for systems with sector bounded nonlinearities. We aim to keep the states of the system within a given safe set under potential actuator and sensor…

Systems and Control · Electrical Eng. & Systems 2025-04-15 Yankai Lin , Michelle S. Chong , Carlos Murguia

The rise of deep learning has led to various successful attempts to apply deep neural networks (DNNs) for important networking tasks such as intrusion detection. Yet, running DNNs in the network control plane, as typically done in existing…

Cryptography and Security · Computer Science 2024-07-01 Kamran Razavi , Shayan Davari Fard , George Karlos , Vinod Nigade , Max Mühlhäuser , Lin Wang

During the last decade, various approaches have been put forward to integrate business processes with different types of data. Each of such approaches reflects specific demands in the whole process-data integration spectrum. One particular…

Artificial Intelligence · Computer Science 2020-06-12 Silvio Ghilardi , Alessandro Gianola , Marco Montali , Andrey Rivkin

In this work, we analyse Petri nets where places are allowed to have a negative number of tokens. For each net we build its correspondent category of executions, which is compact closed, and prove that this procedure is functorial. We…

Category Theory · Mathematics 2019-01-30 Fabrizio Genovese , Jelle Herold

This paper addresses an interference channel consisting of $\mathbf{n}$ active users sharing $u$ frequency sub-bands. Users are asynchronous meaning there exists a mutual delay between their transmitted codes. A stationary model for…

Information Theory · Computer Science 2010-06-17 Kamyar Moshksar , Amir K. Khandani

Interference lies at the heart of the behavior of classical and quantum light. It is thus crucial to understand the boundaries between which interference patterns can be explained by a classical electromagnetic description of light and…

Quantum Physics · Physics 2016-11-29 Luca Rigovacca , Carlo Di Franco , Benjamin J. Metcalf , Ian A. Walmsley , M. S. Kim

Cyber incidents can have a wide range of cause from a simple connection loss to an insistent attack. Once a potential cyber security incidents and system failures have been identified, deciding how to proceed is often complex. Especially,…

Computers and Society · Computer Science 2020-07-16 Sandro Passarelli , Cem Gündogan , Lars Stiemert , Matthias Schopp , Peter Hillmann

Provenance-based Intrusion Detection Systems (PIDSes) have been widely used to detect Advanced Persistent Threats (APTs). Although many studies achieve high performance in the evaluations of their original papers, their performance in…

Cryptography and Security · Computer Science 2026-03-25 Yue Xiao , Ling Jiang , Sen Nie , Ding Li , Shi Wu , Ke Xu , Qi Li

We theoretically introduce and experimentally demonstrate the realization of a nonclassicality test that allows for arbitrarily low detection efficiency without invoking any extra assumptions as independence of the devices. Our test and its…

Quantum Physics · Physics 2020-09-30 A. Hameedi , B. Marques , P. Mironowicz , D. Saha , M. Pawlowski , M. Bourennane

This paper presents an unusual view of interference wireless networks based on complex system thinking. To proceed with this analysis, a literature review of the different applications of complex systems is firstly presented to illustrate…

Information Theory · Computer Science 2013-03-13 Pedro H. J. Nardelli , Paulo Cardieri , William A. Kretzschmar , Matti Latva-aho

A Petri net is choice-free if any place has at most one transition in its postset (consuming its tokens) and it is (extended) free-choice (EFC) if the postsets of any two places are either equal or disjoint. Asymmetric choice (AC) extends…

Formal Languages and Automata Theory · Computer Science 2019-11-25 Harro Wimmel

Trace properties, which are sets of execution traces, are often used to analyze systems, but their expressiveness is limited. Clarkson and Schneider defined hyperproperties as a generalization of trace properties to sets of sets of traces.…

Logic in Computer Science · Computer Science 2023-10-03 Bernd Finkbeiner , Ernst-Rüdiger Olderog
‹ Prev 1 8 9 10 Next ›