English
Related papers

Related papers: Synthesizing Petri Nets from Labelled Petri Nets u…

200 papers

Automated synthesis from behavioural specifications is an attractive and powerful way of constructing concurrent systems. Here we focus on the problem of synthesising a membrane system from a behavioural specification given in the form of a…

Logic in Computer Science · Computer Science 2012-11-20 Jetty Kleijn , Maciej Koutny , Marta Pietkiewicz-Koutny , Grzegorz Rozenberg

Most approaches to the synthesis of reactive systems study the problem in terms of a two-player game with complete observation. In many applications, however, the system's environment consists of several distinct entities, and the system…

Logic in Computer Science · Computer Science 2018-09-11 Bernd Finkbeiner , Paul Gölz

We identify and demonstrate a weakness of Petri Nets (PN) in specifying composite behavior of reactive systems. Specifically, we show how, when specifying multiple requirements in one PN model, modelers are obliged to specify mechanisms for…

Software Engineering · Computer Science 2023-04-20 Achiya Elyasaf , Tom Yaacov , Gera Weiss

In Petri net synthesis we ask whether a given transition system $A$ can be implemented by a Petri net $N$. Depending on the level of accuracy, there are three ways how $N$ can implement $A$: an embedding, the least accurate implementation,…

Formal Languages and Automata Theory · Computer Science 2023-06-22 Raymond Devillers , Ronny Tredup

A modern approach to engineering correct-by-construction systems is to synthesize them automatically from formal specifications. Oftentimes, a system can only satisfy its guarantees if certain environment assumptions hold, which motivates…

Logic in Computer Science · Computer Science 2015-07-10 Roderick Bloem , Ruediger Ehlers , Robert Koenighofer

Petri Net is a formalism to describe changes between 2 or more states across discrete time and has been used to model many systems. We present PNet - a pure Python library for Petri Net modeling and simulation in Python programming…

Mathematical Software · Computer Science 2023-02-24 Zhu En Chay , Bing Feng Goh , Maurice HT Ling

In order to speed up the synthesis of Petri nets from labelled transition systems, a divide and conquer strategy consists in defining decompositions of labelled transition systems, such that each component is synthesisable iff so is the…

Formal Languages and Automata Theory · Computer Science 2023-06-22 Raymond Devillers

Ensuring that agents satisfy safety specifications can be crucial in safety-critical environments. While methods exist for controller synthesis with safe temporal specifications, most existing methods restrict safe temporal specifications…

Logic in Computer Science · Computer Science 2025-11-21 Gaspard Ohlmann , Edwin Hamel-De le Court , Francesco Belardinelli

Supply chains involve geographically distributed manufacturing and assembly sites that must be coordinated under strict timing and resource constraints. While many existing approaches rely on Colored Petri Nets to model material flows, this…

Systems and Control · Electrical Eng. & Systems 2026-04-07 Eric Lubat , Pierre-Emmanuel Hladik , Yoann Mateu , Rémi Sauvère

The manual implementation of distributed systems is an error-prone task because of the asynchronous interplay of components and the environment. Bounded synthesis automatically generates an implementation for the specification of the…

Logic in Computer Science · Computer Science 2020-04-27 Jesko Hecking-Harbusch , Niklas O. Metzger

Petri net synthesis consists in deciding for a given transition system $A$ whether there exists a Petri net $N$ whose reachability graph is isomorphic to $A$. Several works examined the synthesis of Petri net subclasses that restrict, for…

Formal Languages and Automata Theory · Computer Science 2023-06-22 Raymond Devillers , Ronny Tredup

We study automated test generation for verifying discrete decision-making modules in autonomous systems. We utilize linear temporal logic to encode the requirements on the system under test in the system specification and the behavior that…

Rule-based systems remain central in safety-critical domains but often struggle with scalability, brittleness, and goal misspecification. These limitations can lead to reward hacking and failures in formal verification, as AI systems tend…

Logic in Computer Science · Computer Science 2026-05-12 Zainab Rehan , Christian Medeiros Adriano , Sona Ghahremani , Holger Giese

We consider approaches for causal semantics of Petri nets, explicitly representing dependencies between transition occurrences. For one-safe nets or condition/event-systems, the notion of process as defined by Carl Adam Petri provides a…

Logic in Computer Science · Computer Science 2021-03-02 Rob van Glabbeek , Ursula Goltz , Jens-Wolfhard Schicke

A challenging problem for autonomous systems is to synthesize a reactive controller that conforms to a set of given correctness properties. Linear temporal logic (LTL) provides a formal language to specify the desired behavioral properties…

Formal Languages and Automata Theory · Computer Science 2019-10-08 Rayna Dimitrova , Mahsa Ghasemi , Ufuk Topcu

For a large Markovian model, a "product form" is an explicit description of the steady-state behaviour which is otherwise generally untractable. Being first introduced in queueing networks, it has been adapted to Markovian Petri nets. Here…

Discrete Mathematics · Computer Science 2012-04-17 Serge Haddad , Jean Mairesse , Hoang-Thach Nguyen

In many complex systems that can be modeled using Petri nets time can be a very important factor which should be taken into account during creation and analysis of the model. Time data can describe starting moments of some actions or their…

Formal Languages and Automata Theory · Computer Science 2024-05-16 Marcin Radom , Piotr Formanowicz

Specifications - precise mathematical representations of correct domain-specific behaviors - are crucial to guarantee the trustworthiness of computer systems. With the increasing development of neural networks as computer system components,…

Artificial Intelligence · Computer Science 2024-12-05 Isha Chaudhary , Shuyi Lin , Cheng Tan , Gagandeep Singh

Automatic synthesis from linear temporal logic (LTL) specifications is widely used in robotic motion planning, control of autonomous systems, and load distribution in power networks. A common specification pattern in such applications…

Logic in Computer Science · Computer Science 2018-04-03 Rayna Dimitrova , Mahsa Ghasemi , Ufuk Topcu

Transition systems (TS) and Petri nets (PN) are important models of computation ubiquitous in formal methods for modeling systems. An important problem is how to extract from a given TS a PN whose reachability graph is equivalent (with a…

Formal Languages and Automata Theory · Computer Science 2022-05-05 Viktor Teren , Jordi Cortadella , Tiziano Villa
‹ Prev 1 2 3 10 Next ›