Sciweavers

357 search results - page 34 / 72
» On the Model of Computation of Place Transition Petri Nets
Sort
View
CONCUR
2000
Springer
14 years 12 days ago
Model Checking with Finite Complete Prefixes Is PSPACE-Complete
Unfoldings are a technique for verification of concurrent and distributed systems introduced by McMillan. The method constructs a finite complete prefix, which can be seen as a sym...
Keijo Heljanko
CONCUR
2000
Springer
14 years 1 months ago
LP Deadlock Checking Using Partial Order Dependencies
Model checking based on the causal partial order semantics of Petri nets is an approach widely applied to cope with the state space explosion problem. One of the ways to exploit su...
Victor Khomenko, Maciej Koutny
ICCSA
2005
Springer
14 years 2 months ago
Modelling of Process of Electronic Signature with Petri Nets and (Max, Plus) Algebra
This article discusses the modelling and the evaluation of process of electronic signature (ES). According to a certain point of view, this process can be shown as a class of Dynam...
Ahmed Nait-Sidi-Moh, Maxime Wack
DAC
1996
ACM
14 years 29 days ago
Methodology and Tools for State Encoding in Asynchronous Circuit Synthesis
This paper proposes a state encoding method for asynchronous circuits based on the theory of regions. A region in a Transition System is a set of states that "behave uniforml...
Jordi Cortadella, Michael Kishinevsky, Alex Kondra...
ASP
2001
Springer
14 years 1 months ago
Answer Set Programming and Bounded Model Checking
In this paper bounded model checking of asynchronous concurrent systems is introduced as a promising application area for answer set programming. This is an extension of earlier w...
Keijo Heljanko, Ilkka Niemelä