Filtrer vos résultats
- 36
- 22
- 31
- 14
- 8
- 3
- 1
- 1
- 8
- 1
- 58
- 1
- 2
- 3
- 4
- 5
- 3
- 3
- 3
- 5
- 2
- 2
- 6
- 3
- 1
- 5
- 4
- 2
- 1
- 4
- 57
- 1
- 51
- 39
- 10
- 7
- 7
- 6
- 5
- 2
- 2
- 2
- 2
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 58
- 16
- 9
- 8
- 6
- 6
- 5
- 4
- 4
- 3
- 3
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
58 résultats
|
|
|
triés par
|
|
|
Preserving Partial Order Runs in Parametric Time Petri NetsACM Transactions on Embedded Computing Systems (TECS), 2016, 16, pp.25. ⟨10.1145/3012283⟩
Article dans une revue
hal-01425696v1
|
||
|
|
Pomsets and Unfolding of Reset Petri NetsLATA 2018 - 12th International Conference on Language and Automata Theory and Applications, Apr 2018, Ramat Gan, Israel
Communication dans un congrès
hal-01766530v1
|
||
|
|
Alignment-based Quality Metrics in Conformance CheckingEMISA'16 - 7th International Workshop on Enterprise Modelling and Information Systems Architectures , Oct 2016, Vienna, Austria
Communication dans un congrès
hal-01406813v1
|
||
|
|
On the use of unfoldings to abstract communicating automata into sets of scenarios[Research Report] PI 1751, 2005, pp.23
Rapport
inria-00001030v1
|
||
|
|
Taking Complete Finite Prefixes To High Level, Symbolically2023
Pré-publication, Document de travail
hal-04297773v1
|
||
|
|
Symbolic Unfoldings for Networks of Timed Automata4th Int. Symp. on Automated Technology for Verification and Analysis (ATVA'06), Oct 2006, Beijing, China. pp.307--321
Communication dans un congrès
inria-00363033v1
|
||
Sémantique concurrente symbolique des réseaux de Petri saufs et dépliages finis des réseaux temporelsActes de la 10ème Conférence Internationale sur les NOuvelles TEchnologies de la RÉpartition (NOTERE'10), 2010, Tozeur, Tunisia, Tunisie
Communication dans un congrès
hal-00779904v1
|
|||
|
|
Concurrency in Boolean networksNatural Computing, 2020, 19 (1), pp.91--109. ⟨10.1007/s11047-019-09748-4⟩
Article dans une revue
hal-01893106v2
|
||
|
|
An Inverse Method for Parametric Timed AutomataInternational Journal of Foundations of Computer Science, 2009, 20 (5), pp.819-836. ⟨10.1142/S0129054109006905⟩
Article dans une revue
hal-00772641v1
|
||
|
|
Boolean Networks: Beyond Generalized AsynchronicityAUTOMATA 2018 - 24th IFIP WG 1.5 International Workshop on Cellular Automata and Discrete Complex Systems, Jun 2018, Ghent, Belgium. pp.29-42, ⟨10.1007/978-3-319-92675-9_3⟩
Communication dans un congrès
hal-01768359v2
|
||
|
|
Unfolding-based Diagnosis of Systems with an Evolving TopologyInformation and Computation, 2010, 10, pp.1169-1192. ⟨10.1016/j.ic.2009.11.009⟩
Article dans une revue
inria-00638204v1
|
||
|
|
Optimized SAT encoding of conformance checking artefactsComputing, 2021, 103 (1), pp.29-50. ⟨10.1007/s00607-020-00831-8⟩
Article dans une revue
hal-03132554v1
|
||
|
|
Characterization of Reachable Attractors Using Petri Net UnfoldingsCMSB 2014, Nov 2014, Manchester, United Kingdom. pp.14, ⟨10.1007/978-3-319-12982-2_10⟩
Communication dans un congrès
hal-01060450v1
|
||
|
|
An Inverse Method for Parametric Timed AutomataThe Second Workshop on Reachability Problems in Computational Models (RP 2008), Sep 2008, Liverpool, United Kingdom. pp.29-46, ⟨10.1016/j.entcs.2008.12.029⟩
Communication dans un congrès
hal-01299163v1
|
||
Preserving Partial Order Runs in Parametric Time Petri Nets15th International Conference on Application of Concurrency to System Design (ACSD'15), 2015, Brussels, Belgium
Communication dans un congrès
hal-01242847v1
|
|||
|
|
A Discounted Cost Function for Fast Alignments of Business ProcessesBPM 2021 - 19th International Conference on Business Process Management, Sep 2021, Rome, France. ⟨10.1007/978-3-030-85469-0_17⟩
Communication dans un congrès
hal-03362277v1
|
||
Message from the ACSD 2018 Program Chairs2018 18th International Conference on Application of Concurrency to System Design (ACSD), Jun 2018, Bratislava, France. ⟨10.1109/ACSD.2018.00005⟩
Communication dans un congrès
hal-01936815v1
|
|||
|
|
Avoiding Shared Clocks in Networks of Timed AutomataProceedings of the 23rd International Conference on Concurrency Theory (CONCUR'12), 2012, Newcastle, UK, United Kingdom. pp.100-114, ⟨10.1007/978-3-642-32940-1_9⟩
Communication dans un congrès
hal-00776574v1
|
||
|
|
Taking Complete Finite Prefixes To High Level, Symbolically (Full Version)Petri Nets 2023 - 44TH International Conference on Applications and Theory of Petri Nets and Concurrency, R&D Group on Reconfigurable and Embedded Systems at NOVA School of Science and Technology, Mar 2023, Caparica (Lisbonne), Portugal
Communication dans un congrès
hal-04029490v1
|
||
|
|
Application and Theory of Petri Nets and Concurrency - 41st International Conference, PETRI NETS 2020, Paris, France, June 24-25, 2020, ProceedingsSpringer, 2020, ⟨10.1007/978-3-030-51831-8⟩
Ouvrages
hal-03132586v1
|
||
|
|
Back in Time Petri Nets2013
Pré-publication, Document de travail
hal-00840344v1
|
||
Back in Time Petri NetsFORMATS'13, 2013, Argentina. pp.91-105
Communication dans un congrès
hal-00925467v1
|
|||
|
|
Timed Alignments2022 4th International Conference on Process Mining (ICPM), Oct 2022, Bolzano, Italy. pp.112-119, ⟨10.1109/ICPM57379.2022.9980687⟩
Communication dans un congrès
hal-03703712v1
|
||
|
|
An A*-Algorithm for Computing Discounted Anti-Alignments in Process Mining3rd International Conference on Process Mining, Oct 2021, Eindhoven, Netherlands
Communication dans un congrès
hal-03229744v2
|
||
|
|
Anti-Alignments in Conformance Checking - The Dark Side of Process Models37th International Conference on Applications and Theory of Petri Nets (PETRI NETS 2016), 2016, Torún, Poland. pp.240-258
Communication dans un congrès
hal-01408043v1
|
||
|
|
Avoiding Shared Clocks in Networks of Timed Automata[Research Report] RR-7990, INRIA. 2012, pp.26
Rapport
hal-00706608v1
|
||
Building Occurrence Nets from Reveals RelationsFundamenta Informaticae, 2013, 123 (3), pp.245-272
Article dans une revue
hal-00925754v1
|
|||
A Canonical Contraction for Safe Petri NetsLNCS Transactions on Petri Nets and Other Models of Concurrency, 2014, LNCS 8910, pp.83-98
Article dans une revue
hal-01091171v1
|
|||
|
|
Factorization Properties of Symbolic Unfoldings of Colored Petri NetsProceedings of the 31st International Conference on Applications and Theory of Petri Nets (ICATPN'10), 2010, Braga, Portugal. pp.165-184, ⟨10.1007/978-3-642-13675-7_11⟩
Communication dans un congrès
hal-00779901v1
|
||
|
|
A Concurrency-Preserving Translation from Time Petri Nets to Networks of Timed AutomataFormal Methods in System Design, 2012, 40 (3), pp.330-355. ⟨10.1007/s10703-012-0146-4⟩
Article dans une revue
hal-00776605v1
|
- 1
- 2