201 search results - page 14 / 41 » Petri nets with causal time for system verification |
175
click to vote
ASPDAC
2007
ACM
15 years 10 months ago
2007
ACM
This paper presents a Boolean based symbolic model checking algorithm for the verification of analog/mixedsignal (AMS) circuits. The systems are modeled in VHDL-AMS, a hardware des...
248
click to vote
TII
2011
15 years 1 months ago
2011
Abstract—Software systems that do not meet their timing constraints can cause risks. In this work, we propose a comprehensive method for assessing the risk of timing failure by e...
186
click to vote
APN
2000
Springer
15 years 9 months ago
2000
Springer
Many techniques for the verification of reactive systems rely on the analysis of their reachable state spaces. In this paper, a new algorithm for the symbolic generation of the sta...
209
click to vote
IHIS
2005
ACM
15 years 11 months ago
2005
ACM
Current Web services composition proposals, such as BPML, BPEL, WSCI, and OWL-S, provide notations for describing the control and data flows in Web service collaborations. However...
150
click to vote
TACAS
2007
Springer
16 years 5 days ago
2007
Springer
Abstract. Time Petri Nets (TPN) and Timed Automata (TA) are widely-used formalisms for the modeling and analysis of timed systems. A recently-developed approach for the analysis of...