Formal specification and model checking of a ride-sharing system in maude

0Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We report on a case study in which we have formally specified a ride-sharing system in Maude, a rewriting logic-based specification/programming language and model checked that the system enjoys desired liveness as well as safety properties with the Maude LTL model checker. In our approach to formal specification of the system, a map, a collection of cars and a collection of persons are treated as parameters. Thus, it suffices to write one formal systems specification from which the specification instance is generated for each fixed map, each fixed collection of cars and each fixed collection of persons. We often need fairness assumptions to model check liveness properties, which makes model checking performance slower or even infeasible. The case study also demonstrates that such a situation can be alleviated by a divide & conquer approach to liveness model checking under fairness.

Cite

CITATION STYLE

APA

Muramoto, E., Ogata, K., & Shinoda, Y. (2020). Formal specification and model checking of a ride-sharing system in maude. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 12028 LNCS, pp. 187–204). Springer. https://doi.org/10.1007/978-3-030-41418-4_14

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free