Search

Your search keyword '"Posenato, Roberto"' showing total 148 results
Start Over Author "Posenato, Roberto"
148 results on '"Posenato, Roberto"'

1. Introducing Agile Controllability in Temporal Business Processes

Author

Posenato, Roberto, Franceschetti, Marco, Combi, Carlo, Eder, Johann, van der Aalst, Wil, Series Editor, Ram, Sudha, Series Editor, Rosemann, Michael, Series Editor, Szyperski, Clemens, Series Editor, Guizzardi, Giancarlo, Series Editor, van der Aa, Han, editor, Bork, Dominik, editor, Schmidt, Rainer, editor, and Sturm, Arnon, editor

Published
2024
Full Text
View/download PDF

6. Hyper Temporal Networks

Author

Comin, Carlo, Posenato, Roberto, and Rizzi, Romeo

Subjects
Computer Science - Data Structures and Algorithms, Computer Science - Artificial Intelligence
Abstract

Simple Temporal Networks (STNs) provide a powerful and general tool for representing conjunctions of maximum delay constraints over ordered pairs of temporal variables. In this paper we introduce Hyper Temporal Networks (HyTNs), a strict generalization of STNs, to overcome the limitation of considering only conjunctions of constraints but maintaining a practical efficiency in the consistency check of the instances. In a Hyper Temporal Network a single temporal hyperarc constraint may be defined as a set of two or more maximum delay constraints which is satisfied when at least one of these delay constraints is satisfied. HyTNs are meant as a light generalization of STNs offering an interesting compromise. On one side, there exist practical pseudo-polynomial time algorithms for checking consistency and computing feasible schedules for HyTNs. On the other side, HyTNs offer a more powerful model accommodating natural constraints that cannot be expressed by STNs like Trigger off exactly delta min before (after) the occurrence of the first (last) event in a set., which are used to represent synchronization events in some process aware information systems/workflow models proposed in the literature.

Published
2015

8. Managing Decision Tasks and Events in Time-Aware Business Process Models

Author

Posenato, Roberto, Zerbato, Francesca, Combi, Carlo, Hutchison, David, Editorial Board Member, Kanade, Takeo, Editorial Board Member, Kittler, Josef, Editorial Board Member, Kleinberg, Jon M., Editorial Board Member, Mattern, Friedemann, Editorial Board Member, Mitchell, John C., Editorial Board Member, Naor, Moni, Editorial Board Member, Pandu Rangan, C., Editorial Board Member, Steffen, Bernhard, Editorial Board Member, Terzopoulos, Demetri, Editorial Board Member, Tygar, Doug, Editorial Board Member, Goos, Gerhard, Founding Editor, Hartmanis, Juris, Founding Editor, Weske, Mathias, editor, Montali, Marco, editor, Weber, Ingo, editor, and vom Brocke, Jan, editor

Published
2018
Full Text
View/download PDF

9. The Dynamic Controllability of Conditional STNs with Uncertainty

Author

Hunsberger, Luke, Posenato, Roberto, and Combi, Carlo

Subjects
Computer Science - Artificial Intelligence, Computer Science - Systems and Control
Abstract

Recent attempts to automate business processes and medical-treatment processes have uncovered the need for a formal framework that can accommodate not only temporal constraints, but also observations and actions with uncontrollable durations. To meet this need, this paper defines a Conditional Simple Temporal Network with Uncertainty (CSTNU) that combines the simple temporal constraints from a Simple Temporal Network (STN) with the conditional nodes from a Conditional Simple Temporal Problem (CSTP) and the contingent links from a Simple Temporal Network with Uncertainty (STNU). A notion of dynamic controllability for a CSTNU is defined that generalizes the dynamic consistency of a CTP and the dynamic controllability of an STNU. The paper also presents some sound constraint-propagation rules for dynamic controllability that are expected to form the backbone of a dynamic-controllability-checking algorithm for CSTNUs.

Published
2012

10. Weak, Strong and Dynamic Controllability of Access-Controlled Workflows Under Conditional Uncertainty

Author

Zavatteri, Matteo, Combi, Carlo, Posenato, Roberto, Viganò, Luca, Hutchison, David, Series Editor, Kanade, Takeo, Series Editor, Kittler, Josef, Series Editor, Kleinberg, Jon M., Series Editor, Mattern, Friedemann, Series Editor, Mitchell, John C., Series Editor, Naor, Moni, Series Editor, Pandu Rangan, C., Series Editor, Steffen, Bernhard, Series Editor, Terzopoulos, Demetri, Series Editor, Tygar, Doug, Series Editor, Weikum, Gerhard, Series Editor, Carmona, Josep, editor, Engels, Gregor, editor, and Kumar, Akhil, editor

Published
2017
Full Text
View/download PDF

12. Controlling Time-Awareness in Modularized Processes

Author

Lanz, Andreas, Posenato, Roberto, Combi, Carlo, Reichert, Manfred, van der Aalst, Wil, Series editor, Mylopoulos, John, Series editor, Rosemann, Michael, Series editor, Shaw, Michael J., Series editor, Szyperski, Clemens, Series editor, Schmidt, Rainer, editor, Guédria, Wided, editor, Bider, Ilia, editor, and Guerreiro, Sérgio, editor

Published
2016
Full Text
View/download PDF

13. A New Approach to Checking the Dynamic Consistency of Conditional Simple Temporal Networks

Author

Hunsberger, Luke, Posenato, Roberto, Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Doug, Series editor, Weikum, Gerhard, Series editor, and Rueher, Michel, editor

Published
2016
Full Text
View/download PDF

18. Dynamic Controllability of Parameterized CSTNUs

Author

Marco, Franceschetti, Posenato, Roberto, Combi, Carlo, and Eder, Johann

Subjects
Dynamic controllability, Temporal Constraint Network, Conditional, Uncertainty, Constraint-propagation, Dynamic controllability, Temporal Constraint Network, Constraint-propagation, Uncertainty, Conditional
Published
2023

20. Controllability of Time-Aware Processes at Run Time

Author

Lanz, Andreas, Posenato, Roberto, Combi, Carlo, Reichert, Manfred, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Meersman, Robert, editor, Panetto, Hervé, editor, Dillon, Tharam, editor, Eder, Johann, editor, Bellahsene, Zohra, editor, Ritter, Norbert, editor, De Leenheer, Pieter, editor, and Dou, Deijing, editor

Published
2013
Full Text
View/download PDF

21. Controllability in Temporal Conceptual Workflow Schemata

Author

Combi, Carlo, Posenato, Roberto, Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Nierstrasz, Oscar, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Sudan, Madhu, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Doug, Series editor, Vardi, Moshe Y., Series editor, Weikum, Gerhard, Series editor, Dayal, Umeshwar, editor, Eder, Johann, editor, Koehler, Jana, editor, and Reijers, Hajo A., editor

Published
2009
Full Text
View/download PDF

22. Traps and Pitfalls of Topic-Biased PageRank

Author

Boldi, Paolo, Posenato, Roberto, Santini, Massimo, Vigna, Sebastiano, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Aiello, William, editor, Broder, Andrei, editor, Janssen, Jeannette, editor, and Milios, Evangelos, editor

Published
2008
Full Text
View/download PDF

24. Analysis of a Genetic Model with Finite Populations

Author

Bertoni, Alberto, Campadelli, Paola, Posenato, Roberto, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Dough, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Wang, Lipo, editor, Chen, Ke, editor, and Ong, Yew Soon, editor

Published
2005
Full Text
View/download PDF

26. A Framework for the Internationalization of Data-Intensive Web Applications

Author

Belussi, Alberto, Posenato, Roberto, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Dough, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Koch, Nora, editor, Fraternali, Piero, editor, and Wirsing, Martin, editor

Published
2004
Full Text
View/download PDF

28. Front Matter, Table of Contents, Preface, Conference Organization

Author

Alexander Artikis and Roberto Posenato and Stefano Tonetta, Artikis, Alexander, Posenato, Roberto, Tonetta, Stefano, Alexander Artikis and Roberto Posenato and Stefano Tonetta, Artikis, Alexander, Posenato, Roberto, and Tonetta, Stefano

Abstract

Front Matter, Table of Contents, Preface, Conference Organization

Published
2022
Full Text
View/download PDF

29. LIPIcs, Volume 247, TIME 2022, Complete Volume

Author

Alexander Artikis and Roberto Posenato and Stefano Tonetta, Artikis, Alexander, Posenato, Roberto, Tonetta, Stefano, Alexander Artikis and Roberto Posenato and Stefano Tonetta, Artikis, Alexander, Posenato, Roberto, and Tonetta, Stefano

Abstract

LIPIcs, Volume 247, TIME 2022, Complete Volume

Published
2022
Full Text
View/download PDF

31. Front Matter, Table of Contents, Preface, Conference Organization

Author

Artikis, Alexander, Posenato, Roberto, and Tonetta, Stefano

Subjects
Conference Organization, Computing methodologies → Artificial intelligence, Table of Contents, Applied computing, Information systems, Preface, Front Matter, Theory of computation
Abstract

Front Matter, Table of Contents, Preface, Conference Organization, LIPIcs, Vol. 247, 29th International Symposium on Temporal Representation and Reasoning (TIME 2022), pages 0:i-0:xiv

Published
2022
Full Text
View/download PDF

32. LIPIcs, Volume 247, TIME 2022, Complete Volume

Author

Artikis, Alexander, Posenato, Roberto, and Tonetta, Stefano

Subjects
Data processing Computer science, Computing methodologies → Artificial intelligence, Applied computing, Information systems, ddc:004, LIPIcs, Volume 247, TIME 2022, Complete Volume, Theory of computation
Abstract

LIPIcs, Volume 247, TIME 2022, Complete Volume, LIPIcs, Vol. 247, 29th International Symposium on Temporal Representation and Reasoning (TIME 2022), pages 1-222

Published
2022
Full Text
View/download PDF

34. A schema-based approach to modeling and querying WWW data

Author

Comai, Sara, Damiani, Ernesto, Posenato, Roberto, Tanca, Letizia, Carbonell, Jaime G., editor, Seikmann, Jörg, editor, Goos, G., editor, Hartmanis, J., editor, van Leeuwen, J., editor, Andreasen, Troels, editor, Christiansen, Henning, editor, and Larsen, Henrik Legind, editor

Published
1998
Full Text
View/download PDF

38. Simple Temporal Networks: A Practical Foundation for Temporal Representation and Reasoning (Invited Talk)

Author

Hunsberger, Luke and Posenato, Roberto

Subjects
Theory of computation → Dynamic graph algorithms, Consistency Checking, Dispatchability, Computing methodologies → Temporal reasoning, Mathematics of computing → Graph algorithms, Simple Temporal Networks, Consistency Checking, Restoring Consistency, Dispatchability, Temporal Decoupling Problem, Simple Temporal Networks, Temporal Decoupling Problem, Theory of computation → Network optimization, Restoring Consistency
Abstract

Since Simple Temporal Networks (STNs) were first introduced in 1991, there have been numerous theoretic and algorithmic advances that have made them practical for a wide variety of applications. However, the presentation of most of the important advances have been scattered across numerous conference papers and journal articles. As a result, it is too easy for even experienced researchers to be unaware of results that could positively impact their work. In this talk we review the most important results about STNs for researchers in Artificial Intelligence who are interested in incorporating the management of time and temporal constraints into their projects., LIPIcs, Vol. 206, 28th International Symposium on Temporal Representation and Reasoning (TIME 2021), pages 1:1-1:5

Published
2021

39. Simple Temporal Networks: A Practical Foundation for Temporal Representation and Reasoning (Invited Talk)

Author

Luke Hunsberger and Roberto Posenato, Hunsberger, Luke, Posenato, Roberto, Luke Hunsberger and Roberto Posenato, Hunsberger, Luke, and Posenato, Roberto

Abstract

Since Simple Temporal Networks (STNs) were first introduced in 1991, there have been numerous theoretic and algorithmic advances that have made them practical for a wide variety of applications. However, the presentation of most of the important advances have been scattered across numerous conference papers and journal articles. As a result, it is too easy for even experienced researchers to be unaware of results that could positively impact their work. In this talk we review the most important results about STNs for researchers in Artificial Intelligence who are interested in incorporating the management of time and temporal constraints into their projects.

Published
2021
Full Text
View/download PDF

45. Checking the Dynamic Consistency of Conditional Temporal Networks with Bounded Reaction Times

Author

Hunsberger, Luke and Posenato, Roberto

Subjects
dynamic consistency, reaction time, stn, cstn, stp, conditional simple temporal networks, dynamic consistency, reaction time, cstn, stn, stp, conditional simple temporal networks
Abstract

A Conditional Simple Temporal Network (CSTN) includes time-points, temporal constraints, and observation time-points, whose execution yields information during run-time. Time-points and constraints in a CSTN may only apply in certain scenarios. A CSTN is dynamically consistent (DC) if it has a strategy for executing its time-points such that all relevant constraints will be satisfied no matter how the observations turn out. A dynamic strategy can react to observations in real time, but only after arbitrarily small, but positive delays. Recent work introduced a more realistic epsilon-DC property which, for a fixed epsilon>0, requires all reaction times to be bounded below by epsilon. That work presented an exponential algorithm for checking the epsilon-DC property by translating an exponential number of component networks into a Hyper Temporal Network. But it has not yet been implemented or empirically evaluated. This paper begins by presenting an alternative, equivalent semantics for epsilon-dynamic consistency. It then presents a sound-and-complete epsilon-DC-checking algorithm based on the propagation of labeled constraints. Finally, it presents an empirical evaluation of the new algorithm, the first empirical evaluation of any epsilon-DC-checking algorithm in the literature.

Published
2016
Full Text
View/download PDF

47. Reducing epsilon-DC Checking for Conditional Simple Temporal Networks to DC Checking

Author

Hunsberger, Luke and Posenato, Roberto

Subjects
Conditional Simple Temporal Networks, 000 Computer science, knowledge, general works, 010201 computation theory & mathematics, Dynamic Consistency, Computer Science, 0102 computer and information sciences, Conditional Simple Temporal Networks, Dynamic Consistency, Temporal Constraints, 01 natural sciences, Temporal Constraints
Abstract

Recent work on Conditional Simple Temporal Networks (CSTNs) has introduced the problem of checking the dynamic consistency (DC) property for the case where the reaction time of an execution strategy to observations is bounded below by some fixed epsilon > 0, the so-called epsilon-DC-checking problem. This paper proves that the epsilon-DC-checking problem for CSTNs can be reduced to the standard DC-checking problem for CSTNs - without incurring any computational cost. Given any CSTN S with k observation time-points, the paper defines a new CSTN S_0 that is the same as S, except that for each observation time-point P? in S: (i) P? is demoted to a non-observation time-point in S_0; and (ii) a new observation time-point P_0?, constrained to occur exactly epsilon units after P?, is inserted into S_0. The paper proves that S is epsilon-DC if and only if S_0 is (standard) DC, and that the application of the epsilon-DC-checking constraint-propagation rules to S is equivalent to the application of the corresponding (standard) DC-checking constraint-propagation rules to S_0. Two versions of these results are presented that differ only in whether a dynamic strategy for S_0 can react instantaneously to observations, or only after some arbitrarily small, positive delay. Finally, the paper demonstrates empirically that building S_0 and DC-checking it incurs no computational cost as the sizes of the instances increase.

Published
2018

48. Sound-and-Complete Algorithms for Checking the Dynamic Controllability of Conditional Simple Temporal Networks with Uncertainty

Author

Hunsberger, Luke and Posenato, Roberto

Subjects
Temporal Networks, Conditional Simple Temporal Problem with Uncer- tainty, Dynamic Controllability, Checking Algorithm, 000 Computer science, knowledge, general works, Dynamic Controllability, Temporal Networks, Computer Science, Conditional Simple Temporal Problem with Uncer- tainty, Checking Algorithm
Abstract

A Conditional Simple Temporal Network with Uncertainty (CSTNU) is a data structure for representing and reasoning about time. CSTNUs incorporate observation time-points from Conditional Simple Temporal Networks (CSTNs) and contingent links from Simple Temporal Networks with Uncertainty (STNUs). A CSTNU is dynamically controllable (DC) if there exists a strategy for executing its time-points that guarantees the satisfaction of all relevant constraints no matter how the uncertainty associated with its observation time-points and contingent links is resolved in real time. This paper presents the first sound-and-complete DC-checking algorithms for CSTNUs that are based on the propagation of labeled constraints and demonstrates their practicality.

Published
2018
Full Text
View/download PDF

49. Extending Conditional Simple Temporal Networks with Partially Shrinkable Uncertainty

Author

Combi, Carlo and Posenato, Roberto

Subjects
Conditional Simple Temporal Networks with Uncertainty, Partial Shrink- able Temporal Constraint, Dynamic Controllability, Temporal Constraints, 000 Computer science, knowledge, general works, Conditional Simple Temporal Networks with Uncertainty, Dynamic Controllability, Computer Science, Partial Shrink- able Temporal Constraint, Temporal Constraints
Abstract

The proper handling of temporal constraints is crucial in many domains. As a particular challenge, temporal constraints must be also handled when different specific situations happen (conditional constraints) and when some event occurrences can be only observed at run time (contingent constraints). In this paper we introduce Conditional Simple Temporal Networks with Partially Shrinkable Uncertainty (CSTNPSUs), in which contingent constraints are made more flexible (guarded constraints) and they are also specified as conditional constraints. It turns out that guarded constraints require the ability to reason on both kinds of constraints in a seamless way. In particular, we discuss CSTNPSU features through a motivating example and, then, we introduce the concept of controllability for such networks and the related sound checking algorithm.

Published
2018

Catalog

Books, media, physical & digital resources
See catalog results