Bisimulation through probabilistic testing
Information and Computation
Metrics for Labeled Markov Systems
CONCUR '99 Proceedings of the 10th International Conference on Concurrency Theory
Modular Specification of Hybrid Systems in CHARON
HSCC '00 Proceedings of the Third International Workshop on Hybrid Systems: Computation and Control
A Logical Characterization of Bisimulation for Labeled Markov Processes
LICS '98 Proceedings of the 13th Annual IEEE Symposium on Logic in Computer Science
Towards Hilbertian Formal Methods
ACSD '07 Proceedings of the Seventh International Conference on Application of Concurrency to System Design
An Integrated Specification Framework for Embedded Systems
SEFM '07 Proceedings of the Fifth IEEE International Conference on Software Engineering and Formal Methods
Model checking for a class of performance properties of fluid stochastic models
EPEW'06 Proceedings of the Third European conference on Formal Methods and Stochastic Models for Performance Evaluation
Symmetry reduction for probabilistic model checking
CAV'06 Proceedings of the 18th international conference on Computer Aided Verification
| Hi-index | 0.00 |
Cyber physical systems are examples of a new emerging modelling paradigm that can be defined as multi-dimensional system co-engineering (MScE). In MScE, different aspects of complex systems are considered altogether, producing emergent properties, or loosing some useful ones. This holistic approach requires interdisciplinary methods that result from formal mathematical and AI co-engineering. In this paper, we propose a formal framework consisting of a reference model for multi-agent cyber physical systems, and a formal logic for expressing safety properties. The agents we consider are enabled with continuous physical mobility and evolve in an uncertain physical environment. Moreover, the model is user centric, by defining a complex control that considers the output of a runtime verification process, and possible commands of a human controller. The formal logic, called safety analysis logic (SafAL), combines probabilities with epistemic operators. In SafAL, one can specify the reachability properties of one agent, as well as prescriptive commands to the user. We define symmetry reduction semantics and a new concept of bisimulation for agents. A full abstraction theorem is presented, and it is proved that SafAL represents a logical characterization of bisimulation. A foundational study is carried out for model checking SafAL formulae against Markov models. A fundamental result states that the bisimulation preserves the probabilities of the reachable state sets.