20 search results - page 2 / 4 » Model Checking with Finite Complete Prefixes Is PSPACE-Compl... |
FORMATS
2004
Springer
13 years 11 months ago
2004
Springer
We study the model-checking problem for weighted timed automata and the weighted CTL logic by the bisimulation approach. Weighted timed automata are timed automata extended with co...
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 ...
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 ...
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...
ATVA
2006
Springer
13 years 9 months ago
2006
Springer
Of special interest in formal verification are safety properties, which assert that the system always stays within some allowed region. Each safety property can be associated with...