10 search results - page 1 / 2 » Complete Finite Prefixes of Symbolic Unfoldings of Safe Time... |
APN
2006
Springer
13 years 9 months ago
2006
Springer
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 ...
CONCUR
2000
Springer
13 years 9 months ago
2000
Springer
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...
ATVA
2006
Springer
13 years 9 months ago
2006
Springer
In this paper we give a symbolic concurrent semantics for network of timed automata (NTA) in terms of extended symbolic nets. Extended symbolic nets are standard occurrence nets ex...
ACSD
2008
IEEE
13 years 7 months ago
2008
IEEE
This paper considers distributed systems, defined as a collection of components interacting through interfaces. Components, interfaces and distributed systems are modeled as Petri...
TOPNOC
2008
13 years 5 months ago
2008
Abstract. In a seminal paper, McMillan proposed a technique for constructing a finite complete prefix of the unfolding of bounded (i.e., finitestate) Petri nets, which can be used ...