101 search results - page 17 / 21 » On Reachability in Autonomous Continuous Petri Net Systems |
CAV
2005
Springer
15 years 4 months ago
2005
Springer
Abstract. The coverability problem is decidable for the class of wellstructured transition systems. Until recently, the only known algorithm to solve this problem was based on symb...
SIMUTOOLS
2008
15 years 19 days ago
2008
We sketch the fundamental properties and features of Snoopy, a tool to model and execute (animate, simulate) hierarchical graph-based system descriptions. The tool comes along wit...
128
click to vote
ATVA
2006
Springer
15 years 3 months ago
2006
Springer
Whereas partial order methods have proved their efficiency for the analysis of discrete-event systems, their application to timed systems remains a challenging research topic. Here...
101
click to vote
POPL
1990
ACM
15 years 2 months ago
1990
ACM
Abstract. Concurrent constraint programming is a simple but powerful framework for computation based on four basic computational ideas: concurrency (multiple agents are simultaneou...
QEST
2007
IEEE
15 years 5 months ago
2007
IEEE
—Performance Trees are a recently-proposed mechanism for the specification of performance properties and measures. They represent an attractive alternative to stochastic logics,...