Specification and synthesis of hybrid automata for physics-based animation

Ellman, Thomas

doi:10.1109/ase.2003.1240297

Cited by 6 publications

(1 citation statement)

References 31 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The applications of algebraic theory of automata are not limited to computers but are being seen in many other disciplines of science and engineering, for example, representing characteristics of natural phenomena in biology [25] and modeling of chemical systems using cellular automata [26]. Another interesting application, in which a system is described for synthesizing physics-based animation programs based on hybrid automata, is presented in [27]. Because of having special algebraic characteristic, an automaton can easily be extended to develop algebraic automata.…”

Section: Introductionmentioning

confidence: 99%

Verifying Monoid and Group Morphisms over Strongly Connected Algebraic Automata

Zafar¹,

Hussain²,

Ali³

2010

JSEA

View full text Add to dashboard Cite

Automata theory has played an important role in theoretical computer science since last couple of decades. The alge-braic automaton has emerged with several modern applications, for example, optimization of programs, design of model checkers, development of theorem provers because of having certain interesting properties and structures from algebraic theory of mathematics. Design of a complex system requires functionality and also needs to model its control behavior. Z notation has proved to be an effective tool for describing state space of a system and then defining operations over it. Consequently, an integration of algebraic automata and Z will be a useful computer tool which can be used for modeling of complex systems. In this paper, we have linked algebraic automata and Z defining a relationship between fundamentals of these approaches which is refinement of our previous work. At first, we have described strongly connected algebraic automata. Then homomorphism and its variants over strongly connected automata are specified. Next, monoid endomorphisms and group automorphisms are formalized. Finally, equivalence of endomorphisms and automorphisms under certain assumptions are described. The specification is analyzed and validated using Z/Eves toolset

show abstract

Section: Introductionmentioning

confidence: 99%

Verifying Monoid and Group Morphisms over Strongly Connected Algebraic Automata

Zafar¹,

Hussain²,

Ali³

2010

JSEA

View full text Add to dashboard Cite

show abstract

Designing Security Requirements Models Through Planning

Bryl

Massacci

Mylopoulos

et al. 2006

Notes on Numerical Fluid Mechanics and Multidisciplinary Design

View full text Add to dashboard Cite

Abstract. The quest for designing secure and trusted software has led to refined Software Engineering methodologies that rely on tools to support the design process. Automated reasoning mechanisms for requirements and software verification are by now a well-accepted part of the design process, and model driven architectures support the automation of the refinement process. We claim that we can further push the envelope towards the automatic exploration and selection among design alternatives and show that this is concretely possible for Secure Tropos, a requirements engineering methodology that addresses security and trust concerns. In Secure Tropos, a design consists of a network of actors (agents, positions or roles) with delegation/permission dependencies among them. Accordingly, the generation of design alternatives can be accomplished by a planner which is given as input a set of actors and goals and generates alternative multiagent plans to fulfill all given goals. We validate our claim with a case study using a state-of-the-art planner.

show abstract

Specification and Synthesis of Hybrid Automata for Physics-Based Animation

Ellman

2004

Logic Based Program Synthesis and Transformation

View full text Add to dashboard Cite

Physics-based animation programs can often be modeled in terms of hybrid automata. A hybrid automaton includes both discrete and continuous dynamical variables. The discrete variables define the automaton's modes of behavior. The continuous variables are governed by mode-dependent differential equations. This paper describes a system for specifying and automatically synthesizing physics-based animation programs based on hybrid automata. The system presents a program developer with a family of parameterized specification schemata. Each scheme describes a pattern of behavior as a hybrid automaton passes through a sequence of modes. The developer specifies a program by selecting one or more schemata and supplying application-specific instantiation parameters for each of them. Each scheme is associated with a set of axioms in a logic of hybrid automata. The axioms serve to document the semantics of the specification scheme. Each scheme is also associated with a set of implementation rules. The rules synthesize program components implementing the specification in a general physics-based animation architecture. The system allows animation programs to be developed and tested in an incremental manner. The system itself can be extended to incorporate additional schemata for specifying new patterns of behavior, along with new sets of axioms and implementation rules. It has been implemented and tested on over a dozen examples. We believe this research is a significant step toward a specification and synthesis system that is flexible enough to handle a wide variety of animation programs, yet restricted enough to permit programs to be synthesized automatically.

show abstract

Specification and synthesis of hybrid automata for physics-based animation

Abstract: Physics

Cited by 6 publications

References 31 publications

Verifying Monoid and Group Morphisms over Strongly Connected Algebraic Automata

Verifying Monoid and Group Morphisms over Strongly Connected Algebraic Automata

Designing Security Requirements Models Through Planning

Specification and Synthesis of Hybrid Automata for Physics-Based Animation

Contact Info

Product

Resources

About