Polynomial Interrupt Timed Automata

Autor: Claudine Picaronny, Mathieu Sassolas, Serge Haddad, Mohab Safey El Din, Béatrice Bérard

Publikováno v: Lecture Notes in Computer Science ISBN: 9783319245362
RP
The 9th Workshop on Reachability Problems (RP'15)
The 9th Workshop on Reachability Problems (RP'15), Sep 2015, Warsaw, Poland. pp.20-32, ⟨10.1007/978-3-319-24537-9_3⟩

Interrupt Timed Automata (ITA) form a subclass of stopwatch automata where reachability and some variants of timed model checking are decidable even in presence of parameters. They are well suited to model and analyze real-time operating systems. Her

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::781a68c5264f6a67fd97728652e60b8b
https://doi.org/10.1007/978-3-319-24537-9_3

A well-structured framework for analysing petri net extensions

Autor: Alain Finkel, Pierre McKenzie, Claudine Picaronny

Publikováno v: Information and Computation. 195:1-29

Transition systems defined from recursive functions INp→INp are introduced and named WSNs, or well-structured nets. Such nets sit conveniently between Petri net extensions and general transition systems. In the first part of this paper, we study de

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::85f0621a38c52c675d319c6e6167b3b1
https://doi.org/10.1016/j.ic.2004.01.005

Accepting Zeno words: a way toward timed refinements

Autor: Béatrice Bérard, Claudine Picaronny

Publikováno v: Acta Informatica. 37:45-81

Timed models were introduced to describe the behaviors of real-time systems and they were usually required to produce only executions with divergent sequences of times. However, when some physical phenomena are represented by convergent executions, Z

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::0941adbaec691acaecf8c2c01217acc2
https://doi.org/10.1007/s002360050003

Coupling and Importance Sampling for Statistical Model Checking

Autor: Benoît Barbot, Claudine Picaronny, Serge Haddad

Publikováno v: Proceedings of the 18th International Conference on Tools and Algorithms for Construction and Analysis of Systems (TACAS'12)
Proceedings of the 18th International Conference on Tools and Algorithms for Construction and Analysis of Systems (TACAS'12), 2012, Tallinn, Estonia. pp.331-346, ⟨10.1007/978-3-642-28756-5_23⟩
Tools and Algorithms for the Construction and Analysis of Systems ISBN: 9783642287558
TACAS

International audience; Statistical model-checking is an alternative verification technique applied on stochastic systems whose size is beyond numerical analysis ability. Given a model (most often a Markov chain) and a formula, it provides a confiden

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::6de6b6375fcbfd98367688ba749f5707
http://ora.ox.ac.uk/objects/uuid:a1de1117-b88f-44a6-8460-89cae1811c19

Coupling and Self-stabilization

Autor: Claudine Picaronny, Stéphane Messika, Laurent Fribourg

Publikováno v: Lecture Notes in Computer Science ISBN: 9783540233060
DISC

A randomized self-stabilizing algorithm \({\cal A}\) is an algorithm that, whatever the initial configuration is, reaches a set \({\cal L}\) of legal configurations in finite time with probability 1. The proof of convergence towards \({\cal L}\) is g

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::46a57d6e98e28c3360a918605cadda73
https://doi.org/10.1007/978-3-540-30186-8_15