Achievable Bisimilar Behaviour of Abstract State Systems

doi 10.1109/cdc.2005.1582376
Full Text
Abstract

Available in full text

Date

Unknown

Authors
Publisher

IEEE

Related search

Formalization of Abstract State Transition Systems for SAT

Logical Methods in Computer Science
Computer ScienceTheoretical Computer Science
2011English

The Steady-State Behaviour of Multistate Monotone Systems

Journal of Applied Probability
MathematicsStatisticsUncertaintyProbability
1984English

Concurrent Abstract State Machines

Acta Informatica
Computer NetworksSoftwareInformation SystemsCommunications
2015English

State Enumeration With Abstract Descriptions of State Machines

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1995English

Verifying the Accuracy of Interlocking Tables for Railway Signalling Systems Using Abstract State Machines

Journal of Modern Transportation
Electronic EngineeringComputer Science ApplicationsElectricalMechanical EngineeringTransportation
2016English

Termination of Abstract Reduction Systems

International Journal of Foundations of Computer Science
Computer Science
2009English

Achievable Casimirs and Its Implications on Control of Port-Hamiltonian Systems

International Journal of Control
ControlSystems EngineeringComputer Science Applications
2007English

Inverse Systems of Abstract Lebesgue Spaces

Proceedings of the American Mathematical Society
MathematicsApplied Mathematics
1990English

Best Achievable Tracking Performance in Sampled-Data Systems via LTI Controllers

IEEE Transactions on Automatic Control
ControlSystems EngineeringComputer Science ApplicationsElectricalElectronic Engineering
2008English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy