Sciweavers

201 search results - page 1 / 41
» Petri nets with causal time for system verification
Sort
View
ENTCS
2002
91views more  ENTCS 2002»
13 years 4 months ago
Petri nets with causal time for system verification
We present a new approach to the modelling of time constrained systems. It is based on untimed high-level Petri nets using the concept of causal time. With this concept, the progr...
Cécile Bui Thanh, Hanna Klaudel, Franck Pom...
FUIN
2010
172views more  FUIN 2010»
13 years 2 months ago
Bounded Parametric Verification for Distributed Time Petri Nets with Discrete-Time Semantics
Bounded Model Checking (BMC) is an efficient technique applicable to verification of temporal properties of (timed) distributed systems. In this paper we show for the first time ho...
Michal Knapik, Wojciech Penczek, Maciej Szreter, A...
APN
2006
Springer
13 years 8 months ago
Can I Execute My Scenario in Your Net? VipTool Tells You!
This paper describes the verification module (the VipVerify Module) of the VipTool [4]. VipVerify allows to verify whether a given scenario is an execution of a system model, given...
Robin Bergenthum, Jörg Desel, Gabriel Juh&aac...
APN
2006
Springer
13 years 8 months ago
Complete Finite Prefixes of Symbolic Unfoldings of Safe Time Petri Nets
Abstract. Time Petri nets have proved their interest in modeling realtime concurrent systems. Their usual semantics is defined in term of firing sequences, which can be coded in a ...
Thomas Chatain, Claude Jard
DAC
1996
ACM
13 years 9 months ago
Efficient Partial Enumeration for Timing Analysis of Asynchronous Systems
-- This paper presents an efficient method for the timing verification of concurrent systems, modeled as labeled Timed Petri nets. The verification problems we consider require us ...
Eric Verlind, Gjalt G. de Jong, Bill Lin