Sciweavers

19 search results - page 3 / 4
» Linearity and bisimulation
Sort
View
FSTTCS
2005
Springer
13 years 11 months ago
When Are Timed Automata Weakly Timed Bisimilar to Time Petri Nets?
In this paper4 , we compare Timed Automata (TA) and Time Petri Nets (TPN) with respect to weak timed bisimilarity. It is already known that the class of bounded TPNs is strictly in...
Béatrice Bérard, Franck Cassez, Serg...
ACTA
2007
96views more  ACTA 2007»
13 years 6 months ago
Recursive Petri nets
Abstract. In order to design and analyse complex systems, modelers need formal models with two contradictory requirements: a high expressivity and the decidability of behavioural p...
Serge Haddad, Denis Poitrenaud
CDC
2008
IEEE
131views Control Systems» more  CDC 2008»
14 years 21 days ago
Probabilistic testing for stochastic hybrid systems
— In this paper we propose a testing based method for safety/ reachability analysis of stochastic hybrid systems. Testing based methods are characterized by analysis based on the...
A. Agung Julius, George J. Pappas
ENTCS
2006
140views more  ENTCS 2006»
13 years 6 months ago
Stochastic Ambient Calculus
Mobile Ambients (MA) have acquired a fundamental role in modelling mobility in systems with mobile code and mobile devices, and in computation over administrative domains. We pres...
Maria Grazia Vigliotti, Peter G. Harrison
HYBRID
1999
Springer
13 years 10 months ago
A New Class of Decidable Hybrid Systems
Abstract. One of the most important analysis problems of hybrid systems is the reachability problem. State of the art computational tools perform reachability computation for timed...
Gerardo Lafferriere, George J. Pappas, Sergio Yovi...