default search action
Roberto Posenato
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j16]Alexander Artikis, Roberto Posenato
, Stefano Tonetta:
Temporal representation and reasoning in data-intensive systems. Inf. Syst. 122: 102350 (2024) - [c45]Roberto Posenato
Introducing Agile Controllability in Temporal Business Processes. BPMDS/EMMSAD@CAiSE 2024: 87-99 - [c44]Giovanni Alberto Beltrame, Carlo Combi, Alessandro Farinelli, Roberto Posenato, Giuseppe Pozzi:
Ride-Sharing in Medical Transportations: Dealing with Temporal Requirements. EDBT/ICDT Workshops 2024 - [c43]Luke Hunsberger, Roberto Posenato
Foundations of Dispatchability for Simple Temporal Networks with Uncertainty. ICAART (2) 2024: 253-263 - [c42]Luke Hunsberger, Roberto Posenato
Converting Simple Temporal Networks with Uncertainty into Minimal Equivalent Dispatchable Form. ICAPS 2024: 290-300 - [c41]Johann Eder, Roberto Posenato, Carlo Combi, Marco Franceschetti, Franziska S. Hollauf:
Agile Controllability of Simple Temporal Networks with Uncertainty and Oracles. TIME 2024: 4:1-4:16 - [c40]Luke Hunsberger, Roberto Posenato:
A Faster Algorithm for Finding Negative Cycles in Simple Temporal Networks with Uncertainty. TIME 2024: 9:1-9:15 - [c39]Luke Hunsberger, Roberto Posenato:
Faster Algorithm for Converting an STNU into Minimal Dispatchable Form. TIME 2024: 11:1-11:14 - [c38]Luke Hunsberger, Roberto Posenato:
Robust Execution of Probabilistic STNs. TIME 2024: 12:1-12:19 - 2023
- [j15]Luke Hunsberger, Roberto Posenato
A faster algorithm for converting simple temporal networks with uncertainty into dispatchable form. Inf. Comput. 293: 105063 (2023) - [j14]Roberto Posenato
Flexible temporal constraint management in modularized processes. Inf. Syst. 118: 102257 (2023) - [c37]Marco Franceschetti
Dynamic Controllability of Parameterized CSTNUs. SAC 2023: 965-973 - [c36]Luke Hunsberger, Roberto Posenato
Converting Simple Temporal Networks with Uncertainty into Dispatchable Form - Faster (Extended Abstract). TIME 2023: 20:1-20:3 - 2022
- [j13]Roberto Posenato
Adding flexibility to uncertainty: Flexible Simple Temporal Networks with Uncertainty (FTNU). Inf. Sci. 584: 784-807 (2022) - [j12]Roberto Posenato
CSTNU Tool: A Java library for checking temporal networks. SoftwareX 17: 100905 (2022) - [j11]Mario Ocampo-Pineda
TimeAwareBPMN-js: An editor and temporal verification tool for Time-Aware BPMN processes. SoftwareX 17: 100939 (2022) - [c35]Luke Hunsberger, Roberto Posenato
Speeding Up the RUL¯ Dynamic-Controllability-Checking Algorithm for Simple Temporal Networks with Uncertainty. AAAI 2022: 9776-9785 - [e1]Alexander Artikis
29th International Symposium on Temporal Representation and Reasoning, TIME 2022, November 7-9, 2022, Virtual Conference. LIPIcs 247, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2022, ISBN 978-3-95977-262-4 [contents] - 2021
- [c34]Luke Hunsberger, Roberto Posenato
Simple Temporal Networks: A Practical Foundation for Temporal Representation and Reasoning (Invited Talk). TIME 2021: 1:1-1:5 - 2020
- [c33]Luke Hunsberger, Roberto Posenato:
Faster Dynamic-Consistency Checking for Conditional Simple Temporal Networks. ICAPS 2020: 152-160
2010 – 2019
- 2019
- [j10]Carlo Combi, Roberto Posenato
Conditional Simple Temporal Networks with Uncertainty and Resources. J. Artif. Intell. Res. 64: 931-985 (2019) - [j9]Roberto Posenato
Managing time-awareness in modularized processes. Softw. Syst. Model. 18(2): 1135-1154 (2019) - [c32]Luke Hunsberger, Roberto Posenato:
Propagating Piecewise-Linear Weights in Temporal Networks. ICAPS 2019: 223-231 - 2018
- [c31]Roberto Posenato
Managing Decision Tasks and Events in Time-Aware Business Process Models. BPM 2018: 102-118 - [c30]Luke Hunsberger, Roberto Posenato
Simpler and Faster Algorithm for Checking the Dynamic Consistency of Conditional Simple Temporal Networks. IJCAI 2018: 1324-1330 - [c29]Carlo Combi, Roberto Posenato
Extending Conditional Simple Temporal Networks with Partially Shrinkable Uncertainty. TIME 2018: 9:1-9:16 - [c28]Luke Hunsberger, Roberto Posenato
Sound-and-Complete Algorithms for Checking the Dynamic Controllability of Conditional Simple Temporal Networks with Uncertainty. TIME 2018: 14:1-14:17 - [c27]Luke Hunsberger, Roberto Posenato
Reducing epsilon-DC Checking for Conditional Simple Temporal Networks to DC Checking. TIME 2018: 15:1-15:15 - 2017
- [j8]Carlo Comin, Roberto Posenato
Hyper temporal networks - A tractable generalization of simple temporal networks and its relation to mean payoff games. Constraints An Int. J. 22(2): 152-190 (2017) - [c26]Matteo Zavatteri
Weak, Strong and Dynamic Controllability of Access-Controlled Workflows Under Conditional Uncertainty. BPM 2017: 235-251 - [c25]Carlo Combi, Roberto Posenato
Access Controlled Temporal Networks. ICAART (2) 2017: 118-131 - [c24]Massimo Cairo, Carlo Combi, Carlo Comin, Luke Hunsberger, Roberto Posenato
Incorporating Decision Nodes into Conditional Simple Temporal Networks. TIME 2017: 9:1-9:18 - [c23]Massimo Cairo, Luke Hunsberger, Roberto Posenato
A Streamlined Model of Conditional Simple Temporal Networks - Semantics and Equivalence Results. TIME 2017: 10:1-10:19 - 2016
- [j7]Alessandro Cimatti
Dynamic controllability via Timed Game Automata. Acta Informatica 53(6-8): 681-722 (2016) - [c22]Luke Hunsberger, Roberto Posenato:
Checking the Dynamic Consistency of Conditional Temporal Networks with Bounded Reaction Times. ICAPS 2016: 175-183 - [c21]Andreas Lanz, Roberto Posenato
Controlling Time-Awareness in Modularized Processes. BMMDS/EMMSAD 2016: 157-172 - [c20]Luke Hunsberger, Roberto Posenato
A New Approach to Checking the Dynamic Consistency of Conditional Simple Temporal Networks. CP 2016: 268-286 - 2015
- [c19]Andreas Lanz, Roberto Posenato, Carlo Combi, Manfred Reichert:
Simple Temporal Networks with Partially Shrinkable Uncertainty. ICAART (2) 2015: 370-381 - [c18]Luke Hunsberger, Roberto Posenato
A Sound-and-Complete Propagation-Based Algorithm for Checking the Dynamic Consistency of Conditional Simple Temporal Networks. TIME 2015: 4-18 - [i2]Carlo Comin, Roberto Posenato, Romeo Rizzi:
Hyper Temporal Networks. CoRR abs/1503.03974 (2015) - 2014
- [j6]Carlo Combi
Representing Business Processes Through a Temporal Data-Centric Workflow Modeling Language: An Application to the Management of Clinical Pathways. IEEE Trans. Syst. Man Cybern. Syst. 44(9): 1182-1203 (2014) - [c17]Carlo Comin, Roberto Posenato
A Tractable Generalization of Simple Temporal Networks and Its Relation to Mean Payoff Games. TIME 2014: 7-16 - [c16]Alessandro Cimatti
Sound and Complete Algorithms for Checking the Dynamic Controllability of Temporal Networks with Uncertainty, Disjunction and Observation. TIME 2014: 27-36 - 2013
- [c15]Carlo Combi, Luke Hunsberger, Roberto Posenato:
An Algorithm for Checking the Dynamic Controllability of a Conditional Simple Temporal Network with Uncertainty. ICAART (2) 2013: 144-156 - [c14]Carlo Combi
An Algorithm for Checking the Dynamic Controllability of a Conditional Simple Temporal Network with Uncertainty - Revisited. ICAART (Revised Selected Papers) 2013: 314-331 - [c13]Andreas Lanz, Roberto Posenato
Controllability of Time-Aware Processes at Run Time. OTM Conferences 2013: 39-56 - [c12]Romeo Rizzi, Roberto Posenato
Optimal Design of Consistent Simple Temporal Networks. TIME 2013: 19-25 - 2012
- [j5]Carlo Combi
Conceptual modeling of flexible temporal workflows. ACM Trans. Auton. Adapt. Syst. 7(2): 19:1-19:29 (2012) - [c11]Carlo Combi
Modelling temporal, data-centric medical processes. IHI 2012: 141-150 - [c10]Carlo Combi
On the complexity of temporal controllabilities for workflow schemata. SAC 2012: 60-66 - [i1]Luke Hunsberger, Roberto Posenato, Carlo Combi:
The Dynamic Controllability of Conditional STNs with Uncertainty. CoRR abs/1212.2005 (2012) - 2010
- [c9]Carlo Combi
Towards Temporal Controllabilities for Workflow Schemata. TIME 2010: 129-136
2000 – 2009
- 2009
- [c8]Carlo Combi
Controllability in Temporal Conceptual Workflow Schemata. BPM 2009: 64-79 - 2006
- [j4]Giuliano Grossi
Solving maximum independent set by asynchronous distributed hopfield-type neural networks. RAIRO Theor. Informatics Appl. 40(2): 371-388 (2006) - [c7]Paolo Boldi
Traps and Pitfalls of Topic-Biased PageRank. WAW 2006: 107-116 - 2005
- [c6]Alberto Bertoni, Paola Campadelli, Roberto Posenato
Analysis of a Genetic Model with Finite Populations. ICNC (3) 2005: 235-244 - 2004
- [c5]Alberto Belussi, Roberto Posenato
A Framework for the Internationalization of Data-Intensive Web Applications. ICWE 2004: 478-482 - 2002
- [c4]Giuliano Grossi, Roberto Posenato
A Distributed Algorithm for Max Independent Set Problem Based on Hopfield Networks. WIRN 2002: 64-74
1990 – 1999
- 1998
- [j3]Roberto Posenato
A New Lower Bound on Approximability of the Ground State Problem for Tridimensional Ising Spin Glasses. Inf. Process. Lett. 68(4): 167-171 (1998) - [c3]Sara Comai, Ernesto Damiani, Roberto Posenato
A Schema-Based Approach to Modeling and Querying WWW Data. FQAS 1998: 110-125 - 1997
- [j2]Alberto Bertoni, Paola Campadelli, Cristina Gangai, Roberto Posenato
Approximability of the Ground State Problem for Certain Ising Spin Glasses. J. Complex. 13(3): 326-329 (1997) - [j1]Maria Alberta Alberti, Alberto Bertoni, Paola Campadelli, Giuliano Grossi
A Neural Algorithm for MAX-2SAT: Performance Analysis and Circuit Implementation. Neural Networks 10(3): 555-560 (1997) - [c2]Alberto Bertoni, Paola Campadelli, Roberto Posenato
An Upper Bound for the Maximum Cut Mean Value. WG 1997: 78-84 - 1995
- [c1]Maria Alberta Alberti, Alberto Bertoni, Paola Campadelli, Giuliano Grossi
A neural circuit for the maximum 2-satisfiability problem. PDP 1995: 319-323
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-23 21:25 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: