Roberto Posenato
According to our database^{1},
Roberto Posenato
authored at least 41 papers
between 1995 and 2018.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis OtherLinks
Homepage:

at orcid.org
On csauthors.net:
Bibliography
2018
Reducing epsilonDC Checking for Conditional Simple Temporal Networks to DC Checking.
Proceedings of the 25th International Symposium on Temporal Representation and Reasoning, 2018
SoundandComplete Algorithms for Checking the Dynamic Controllability of Conditional Simple Temporal Networks with Uncertainty.
Proceedings of the 25th International Symposium on Temporal Representation and Reasoning, 2018
Extending Conditional Simple Temporal Networks with Partially Shrinkable Uncertainty.
Proceedings of the 25th International Symposium on Temporal Representation and Reasoning, 2018
Simpler and Faster Algorithm for Checking the Dynamic Consistency of Conditional Simple Temporal Networks.
Proceedings of the TwentySeventh International Joint Conference on Artificial Intelligence, 2018
Managing Decision Tasks and Events in TimeAware Business Process Models.
Proceedings of the Business Process Management  16th International Conference, 2018
2017
Hyper temporal networks  A tractable generalization of simple temporal networks and its relation to mean payoff games.
Constraints, 2017
A Streamlined Model of Conditional Simple Temporal Networks  Semantics and Equivalence Results.
Proceedings of the 24th International Symposium on Temporal Representation and Reasoning, 2017
Incorporating Decision Nodes into Conditional Simple Temporal Networks.
Proceedings of the 24th International Symposium on Temporal Representation and Reasoning, 2017
Access Controlled Temporal Networks.
Proceedings of the 9th International Conference on Agents and Artificial Intelligence, 2017
Weak, Strong and Dynamic Controllability of AccessControlled Workflows Under Conditional Uncertainty.
Proceedings of the Business Process Management  15th International Conference, 2017
2016
Dynamic controllability via Timed Game Automata.
Acta Inf., 2016
A New Approach to Checking the Dynamic Consistency of Conditional Simple Temporal Networks.
Proceedings of the Principles and Practice of Constraint Programming, 2016
Controlling TimeAwareness in Modularized Processes.
Proceedings of the Enterprise, BusinessProcess and Information Systems Modeling, 2016
Checking the Dynamic Consistency of Conditional Temporal Networks with Bounded Reaction Times.
Proceedings of the TwentySixth International Conference on Automated Planning and Scheduling, 2016
2015
Hyper Temporal Networks.
CoRR, 2015
A SoundandComplete PropagationBased Algorithm for Checking the Dynamic Consistency of Conditional Simple Temporal Networks.
Proceedings of the 22nd International Symposium on Temporal Representation and Reasoning, 2015
Simple Temporal Networks with Partially Shrinkable Uncertainty.
Proceedings of the ICAART 2015, 2015
2014
Representing Business Processes Through a Temporal DataCentric Workflow Modeling Language: An Application to the Management of Clinical Pathways.
IEEE Trans. Systems, Man, and Cybernetics: Systems, 2014
A Tractable Generalization of Simple Temporal Networks and Its Relation to Mean Payoff Games.
Proceedings of the 21st International Symposium on Temporal Representation and Reasoning, 2014
Sound and Complete Algorithms for Checking the Dynamic Controllability of Temporal Networks with Uncertainty, Disjunction and Observation.
Proceedings of the 21st International Symposium on Temporal Representation and Reasoning, 2014
2013
Optimal Design of Consistent Simple Temporal Networks.
Proceedings of the 2013 20th International Symposium on Temporal Representation and Reasoning, 2013
Controllability of TimeAware Processes at Run Time.
Proceedings of the On the Move to Meaningful Internet Systems: OTM 2013 Conferences, 2013
An Algorithm for Checking the Dynamic Controllability of a Conditional Simple Temporal Network with Uncertainty  Revisited.
Proceedings of the Agents and Artificial Intelligence  5th International Conference, 2013
An Algorithm for Checking the Dynamic Controllability of a Conditional Simple Temporal Network with Uncertainty.
Proceedings of the ICAART 2013, 2013
2012
Conceptual modeling of flexible temporal workflows.
TAAS, 2012
The Dynamic Controllability of Conditional STNs with Uncertainty
CoRR, 2012
On the complexity of temporal controllabilities for workflow schemata.
Proceedings of the ACM Symposium on Applied Computing, 2012
Modelling temporal, datacentric medical processes.
Proceedings of the ACM International Health Informatics Symposium, 2012
2010
Towards Temporal Controllabilities for Workflow Schemata.
Proceedings of the TIME 2010, 2010
2009
Controllability in Temporal Conceptual Workflow Schemata.
Proceedings of the Business Process Management, 7th International Conference, 2009
2006
Solving maximum independent set by asynchronous distributed hopfieldtype neural networks.
ITA, 2006
Traps and Pitfalls of TopicBiased PageRank.
Proceedings of the Algorithms and Models for the WebGraph, Fourth International Workshop, 2006
2005
Analysis of a Genetic Model with Finite Populations.
Proceedings of the Advances in Natural Computation, First International Conference, 2005
2004
A Framework for the Internationalization of DataIntensive Web Applications.
Proceedings of the Web Engineering  4th International Conference, 2004
2002
A Distributed Algorithm for Max Independent Set Problem Based on Hopfield Networks.
Proceedings of the Neural Nets, 13th Italian Workshop on Neural Nets, 2002
1998
A New Lower Bound on Approximability of the Ground State Problem for Tridimensional Ising Spin Glasses.
Inf. Process. Lett., 1998
A SchemaBased Approach to Modeling and Querying WWW Data.
Proceedings of the Flexible Query Answering Systems, Third International Conference, 1998
1997
A Neural Algorithm for MAX2SAT: Performance Analysis and Circuit Implementation.
Neural Networks, 1997
Approximability of the Ground State Problem for Certain Ising Spin Glasses.
J. Complexity, 1997
An Upper Bound for the Maximum Cut Mean Value.
Proceedings of the GraphTheoretic Concepts in Computer Science, 1997
1995
A neural circuit for the maximum 2satisfiability problem.
Proceedings of the 3rd Euromicro Workshop on Parallel and Distributed Processing (PDP '95), 1995