English
Related papers

Related papers: Raw Report on the Model Checking Contest at Petri …

200 papers

Context: Linear temporal logic (LTL) model checking faces a significant challenge known as the state-explosion problem. The on-the-fly method is a solution that constructs and checks the state space simultaneously, avoiding generating all…

Logic in Computer Science · Computer Science 2024-06-13 Shuo Li , Liao Zheng , Ru Yang , Zhijun Ding

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

This volume contains the joint proceedings of MARS 2018, the third workshop on Models for Formal Analysis of Real Systems, and VPT 2018, the sixth international workshop on Verification and Program Transformation, held together on April 20,…

Logic in Computer Science · Computer Science 2018-03-26 John P. Gallagher , Rob van Glabbeek , Wendelin Serwe

The reachability semantics for Petri nets can be studied using open Petri nets. For us an "open" Petri net is one with certain places designated as inputs and outputs via a cospan of sets. We can compose open Petri nets by gluing the…

Category Theory · Mathematics 2022-07-26 John C. Baez , Jade Master

The categorical modeling of Petri nets has received much attention recently. The Dialectica construction has also had its fair share of attention. We revisit the use of the Dialectica construction as a categorical model for Petri nets…

Category Theory · Mathematics 2025-12-24 Elena Di Lavore , Wilmer Leal , Valeria de Paiva

Monolithic liquid scintillator detector technology is the workhorse for detecting neutrinos and exploring new physics. The KamLAND-Zen experiment exemplifies this detector technology and has yielded top results in the quest for neutrinoless…

High Energy Physics - Experiment · Physics 2024-10-07 Alexander Migala , Eugene Ku , Zepeng Li , Aobo Li

This paper describes the second-placed approach developed by the Fraunhofer SIT team in the CLEF-2023 CheckThat! lab Task 1B for English. Given a text snippet from a political debate, the aim of this task is to determine whether it should…

Computation and Language · Computer Science 2023-07-28 Raphael Frick , Inna Vogel , Jeong-Eun Choi

Checking and confirming factual information in texts and speeches is vital to determine the veracity and correctness of the factual statements. This work was previously done by journalists and other manual means but it is a time-consuming…

Information Retrieval · Computer Science 2020-12-18 Sidharth Singla

Time-Basic Petri nets, is a powerful formalism for model- ing real-time systems where time constraints are expressed through time functions of marking's time description associated with transition, representing possible firing times. We…

Logic in Computer Science · Computer Science 2014-09-10 Matteo Camilli

In this paper, we deal with the formal verification of an encryption scheme for Wireless Sensor Networks (WSNs). Especially, we present our first results on building a framework dedicated to modelling and verification of WSNs aspects. To…

Logic in Computer Science · Computer Science 2013-05-21 Zohra Sbaï , Mohamed Escheikh

This paper presents a transformational approach for model checking two important classes of metric temporal logic (MTL) properties, namely, bounded response and minimum separation, for nonhierarchical object-oriented Real-Time Maude…

Logic in Computer Science · Computer Science 2010-09-23 Daniela Lepri , Peter Csaba Ölveczky , Erika Ábrahám

The worldwide healthcare organizations are facing a number of daunting challenges forcing systems to benefit from modern technologies and telecom capabilities. Hence, systems evolution through extension of the existing information…

Software Engineering · Computer Science 2012-10-23 Sabri Mtibaa , Moncef Tagina

Petri Nets (PN) are extensively used as a robust formalism to model concurrent and distributed systems; however, they encounter difficulties in accurately modeling adaptive systems. To address this issue, we defined rewritable PT nets…

Performance · Computer Science 2024-11-01 Lorenzo Capra , Marco Gribaudo

This volume contains the proceedings of the Eighth Workshop on Model-Based Testing (MBT 2013), which was held on March 17, 2013 in Rome, Italy, as a satellite event of the European Joint Conferences on Theory and Practice of Software, ETAPS…

Software Engineering · Computer Science 2013-03-05 Alexander K. Petrenko , Holger Schlingloff

We survey existing approaches to the formal verification of statecharts using model checking. Although the semantics and subset of statecharts used in each approach varies considerably, along with the model checkers and their specification…

Software Engineering · Computer Science 2009-09-29 Purandar Bhaduri , S. Ramesh

Matlab/Simulink is a development and simulation language that is widely used by the Cyber-Physical System (CPS) industry to model dynamical systems. There are two mainstream approaches to verify CPS Simulink models: model testing that…

Software Engineering · Computer Science 2019-05-10 Shiva Nejati , Khouloud Gaaloul , Claudio Menghi , Lionel C. Briand , Stephen Foster , David Wolfe

Algebraic Petri nets are a formalism for modeling distributed systems and algorithms, describing control and data flow by combining Petri nets and algebraic specification. One way to specify correctness of an algebraic Petri net model $N$…

Logic in Computer Science · Computer Science 2016-06-23 Marvin Triebel , Jan Sürmeli

Trading systems are software platforms that support the exchange of securities (e.g., company shares) between participants. In this paper, we present a method to search for deviations in trading systems by checking conformance between…

Software Engineering · Computer Science 2022-11-01 Julio C. Carrasquel , Irina A. Lomazova

We consider the problem of the verification of an LTL specification $\varphi$ on a system $S$ given some prior knowledge $K$, an LTL formula that $S$ is known to satisfy. The automata-theoretic approach to LTL model checking is implemented…

Formal Languages and Automata Theory · Computer Science 2025-03-31 Alexandre Duret-Lutz , Denis Poitrenaud , Yann Thierry-Mieg

We address the verification problem for concurrent program that dynamically create (fork) new threads or destroy (join) existing threads. We present a reduction to the verification problem for concurrent programs with a fixed number of…

Programming Languages · Computer Science 2023-11-03 Matthias Heizmann , Dominik Klumpp , Frank Schüssele , Lars Nitzke
‹ Prev 1 4 5 6 7 8 10 Next ›