357 search results - page 27 / 72 » On the Model of Computation of Place Transition Petri Nets |
ENTCS
2006
13 years 7 months ago
2006
In this paper, we address the issue of the formal verification of real-time systems in the context of a preemptive scheduling policy. We propose an algorithm which computes the st...
JCSS
2011
13 years 2 months ago
2011
It is widely recognised that software development is a complex process. Among the factors that contribute to its inherent complexity is the gap between the design and the formal a...
CSL
2007
Springer
13 years 11 months ago
2007
Springer
We compare the expressive power of a class of well-structured transition systems that includes relational automata, Petri nets, lossy channel systems, and constrained multiset rewr...
DAC
1996
ACM
13 years 11 months ago
1996
ACM
-- 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 ...
FORMATS
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. Well-known hierarchies discriminate between the computational power of discrete time and space dynamical systems. A contrario the situation is more confused for dynamical...