Filters








14,358 Hits in 5.7 sec

A Constraint Model for State Transitions in Disjunctive Resources [chapter]

Roman Barták, Ondřej Čepek
Lecture Notes in Computer Science  
This paper presents new filtering rules for constraints modelling the state transition diagrams.  ...  However, in practice there frequently appear resources with more complex behaviour that can be described using state transition diagrams.  ...  Each activity is annotated by a resource state requested for processing the activity and there is a state transition diagram describing transitions between the states.  ... 
doi:10.1007/978-3-540-73817-6_3 dblp:conf/csclp/BartakC06 fatcat:ctzfkq2h3vg4ncjxtqtvc44rlm

Backtracking algorithms for disjunctions of temporal constraints

Kostas Stergiou, Manolis Koubarakis
2000 Artificial Intelligence  
This is a wide class of temporal constraints that can be used to model a variety of problems in temporal reasoning, scheduling, planning, and temporal constraint databases.  ...  The results show that hard problems occur at a critical value of the ratio of disjunctions to variables. : S 0 0 0 4 -3 7 0 2 ( 0 0 ) 0 0 0 1 9 -9 82 K. Stergiou, M.  ...  Acknowledgements We would like to thank all members of the APES Research Group and in particular Ian Gent, Patrick Prosser, Toby Walsh and Peter van Beek.  ... 
doi:10.1016/s0004-3702(00)00019-9 fatcat:6hnsyfzhabhdpofageq6la3kqe

J-TRE: An Integrated Reasoning Environment and its Application to Timeline-based Planning

Riccardo De Benedictis
2014 International Conference of the Italian Association for Artificial Intelligence  
As a result, an alternative formalization of the timeline-based planning problem is proposed that allows for an interesting ability to solve both planning and scheduling problems in a uniform schema.  ...  This paper introduces the ongoing work for a novel domain-independent reasoning environment called J-TRE that takes its inspiration from Constraint Logic Programming flavoring it with Object Oriented features  ...  by the state-transition system: nodes are states of the domain; arcs are state transitions or actions; a plan is a sequence of actions corresponding to a path from the initial state to a goal state.  ... 
dblp:conf/aiia/Benedictis14 fatcat:yqibm2u35vebbh4d76ezkqtkry

Action Language Verifier, Extended [chapter]

Tuba Yavuz-Kahveci, Constantinos Bartzis, Tevfik Bultan
2005 Lecture Notes in Computer Science  
Dependency Analysis: Typically, in software specifications, the transition relation corresponds to a disjunction of a set of atomic actions.  ...  of integer variables are represented in a disjunctive form where each disjunct corresponds to a convex polyhedron and each polyhedron corresponds to a conjunction of linear arithmetic constraints.  ... 
doi:10.1007/11513988_40 fatcat:q3ei4xi2pne6jew7rw5qwre4ly

Visopt ShopFloor: Going Beyond Traditional Scheduling [chapter]

Roman Barták
2003 Lecture Notes in Computer Science  
In the paper, we give a motivation for the integration of planning and scheduling and we describe how such integration is realised in the scheduling engine of the Visopt ShopFloor system.  ...  Visopt ShopFloor is a generic scheduling system for solving complex scheduling problems. It differentiates from traditional schedulers by offering some planning capabilities.  ...  I would like to thank the reviewers of the paper for useful comments and to Petr Štepánek and Ondrej Cepek for proofreading.  ... 
doi:10.1007/3-540-36607-5_14 fatcat:wdqoeagnb5dr5ekfbup2ue3c3e

Conditional Simple Temporal Networks with Uncertainty and Resources

Carlo Combi, Roberto Posenato, Luca Viganò, Matteo Zavatteri
2019 The Journal of Artificial Intelligence Research  
We provide a fully-automated encoding to translate any CSTNUR into an equivalent timed game automaton in polynomial time for a sound and complete DC-checking.  ...  In this paper, we define conditional simple temporal networks with uncertainty and resources (CSTNURs) by injecting resources and runtime resource constraints (RRCs) into the specification.  ...  If a guard of a transition contains implications or disjunctions or negations of clock constraints, then it must be transformed in the disjunctive normal form and, then, the transition containing such  ... 
doi:10.1613/jair.1.11453 fatcat:6fvjlk4yinb3zebd3d4um5pr4q

Petri net supervisors for DES with uncontrollable and unobservable transitions

J.O. Moody, P.J. Antsaklis
2000 IEEE Transactions on Automatic Control  
Procedures are given for identifying all admissible linear constraints for a plant with uncontrollable and unobservable transitions, as well as methods for transforming inadmissible constraints into admissible  ...  The controller is described by an auxiliary Petri net connected to the plant's transitions, providing a unified Petri net model of the closed-loop system.  ...  Transitions direct the flow of tokens between places, thus the firing of a transition is a state-changing event in a DES model.  ... 
doi:10.1109/9.847725 fatcat:a6sq3vcvjjhy5l5whbfpd3afq4

The extended resource task network: a framework for the combined scheduling of batch processes and CHP plants

R. Théry, G. Hétreux, M.H. Agha, A. Haït, J.M. Le Lann
2012 International Journal of Production Research  
and the definition of state resource nodes and transition arcs to model the states of multi-modal devices.  ...  . , T ð17Þ State resources balance In conjunction with Equations (2) and (5) , Equation (18) represents the transition between states of a resource.  ... 
doi:10.1080/00207543.2010.545444 fatcat:7opvibxicbdzhmklzi5kg7z5ki

Planning control rules for reactive agents

F. Kabanza, M. Barbeau, R. St-Denis
1997 Artificial Intelligence  
A traditional approach for planning is to evaluate goal statements over state trajectories modeling predicted behaviors of an agent.  ...  We describe goals by using a modal temporal logic that can express quite complex time, safety, and liveness constraints.  ...  for each disjunct f in disjunctive-normal-form(g) 4. for each w in W { 5. s' := create-new-state( ) ; s'. world := w; 6. s'.goal 7. generate-transition( s, a, s') ;}}} Fig. 6.  ... 
doi:10.1016/s0004-3702(97)00031-3 fatcat:a5btk23nbnda7bc54nwwp7nomi

Disjunctive Image Computation for Embedded Software Verification

Chao Wang, Zijiang Yang, F. Ivancic, A. Gupta
2006 Proceedings of the Design Automation & Test in Europe Conference  
Related Work Partitioned transition relations for symbolic image computation were proposed in [7, 9] in both disjunctive and conjunctive forms.  ...  Hypergraph partitioning is used to minimize the number of live variables in each disjunctive component. We use the live variables to simplify transition relations and reachable state subsets.  ...  Decomposition of Transition Relation The transition relation T of a software model can be decomposed naturally into a union of disjunctive components, one for each program location.  ... 
doi:10.1109/date.2006.244049 dblp:conf/date/WangYIG06 fatcat:eervnx3ekbh3jaqwurlaibfz6y

Modelling Resource Transitions in Constraint-Based Scheduling [chapter]

Roman Barták
2002 Lecture Notes in Computer Science  
In the paper we propose a concept of the transition constraint that is used to model a state change in resources. We describe and compare three models of the transition constraint.  ...  Constraint-based scheduling is an approach for solving scheduling problems using constraint satisfaction techniques.  ...  Fig. 1 . 1 A simple transition scheme for the resource.  ... 
doi:10.1007/3-540-36137-5_13 fatcat:3rxvyg53arfgrlwlhjvfvbqgki

Policy mixtures: a novel approach for enhancing the operational flexibility of resource allocation systems with alternate routings

Jonghun Park, S.A. Reveliotis
2002 IEEE Transactions on Robotics and Automation  
The proposed method for constructing the dynamic algebraic LES is presented in the context of the class of Conjunctive / Disjunctive (CD)-RASs, which subsumes the major RAS classes currently studied in  ...  Liveness-enforcing supervisors (LESs) guarantee deadlock-free operations in resource allocation systems (RASs).  ...  Hence, it has been shown that when there exists a set of algebraic LESs for a given RAS, one can define the disjunctive supervisor [8] that admits a RAS state if and only if (iff) the state is admitted  ... 
doi:10.1109/tra.2002.802213 fatcat:rr23xuojp5gk3jfh2rvx2ppflm

Solving scheduling problems from high-level models

Jean-Noël Monette
2010 4OR  
Scheduling problems are very varied, both in application domains and in featured constraints. They have been a large area of research for decades.  ...  of the Thesis Scheduling consists in deciding when a set of activities must be executed under different constraints, in order to optimize a given objective.  ...  Two activities that require different states cannot overlap in time, leading to a disjunctive constraint as for the unary resources. There is no constraint on two activities requiring the same state.  ... 
doi:10.1007/s10288-010-0143-7 fatcat:xl2o2skrdzcjroge7ymc4rnxlm

Engage

Jeffrey Fischer, Rupak Majumdar, Shahram Esmaeilsabzali
2012 SIGPLAN notices  
Engage consists of three components: a domain-specific model to describe component metadata and intercomponent dependencies; a constraint-based algorithm that takes a partial installation specification  ...  We present Engage, a system for configuring, installing, and managing complex application stacks.  ...  These systems use a client-server model in which a server holds the model of the desired state for a machine, and the client ensures this configuration is met.  ... 
doi:10.1145/2345156.2254096 fatcat:6txbmsvjkzf4jhtklyuz7cmtyi

Engage

Jeffrey Fischer, Rupak Majumdar, Shahram Esmaeilsabzali
2012 Proceedings of the 33rd ACM SIGPLAN conference on Programming Language Design and Implementation - PLDI '12  
Engage consists of three components: a domain-specific model to describe component metadata and intercomponent dependencies; a constraint-based algorithm that takes a partial installation specification  ...  We present Engage, a system for configuring, installing, and managing complex application stacks.  ...  These systems use a client-server model in which a server holds the model of the desired state for a machine, and the client ensures this configuration is met.  ... 
doi:10.1145/2254064.2254096 dblp:conf/pldi/FischerME12 fatcat:e7mgtdv5vvehdnbxmmjoxvjh5m
« Previous Showing results 1 — 15 out of 14,358 results