IMT Institutional Repository: No conditions. Results ordered -Date Deposited. 2024-06-16T17:26:25ZEPrintshttp://eprints.imtlucca.it/images/logowhite.pnghttp://eprints.imtlucca.it/2012-09-14T15:24:30Z2016-07-13T10:52:33Zhttp://eprints.imtlucca.it/id/eprint/1350This item is in the repository with the URL: http://eprints.imtlucca.it/id/eprint/13502012-09-14T15:24:30ZState space c-reductions for concurrent systems in rewriting logicWe present c-reductions, a simple, flexible and very general state space reduction technique that exploits an equivalence relation on states that is a bisimulation. Reduction is achieved by a canonizer function, which maps each state into a not necessarily unique canonical representative of its equivalence class. The approach contains symmetry reduction and name reuse and name abstraction as special cases, and exploits the expressiveness of rewriting logic and its realization in Maude to automate c-reductions and to seamlessly integrate model checking and the discharging of correctness proof obligations. The performance of the approach has been validated over a set of representative case studies.Alberto Lluch-Lafuentealberto.lluch@imtlucca.itJosé MeseguerAndrea Vandinandrea.vandin@imtlucca.it2012-06-29T12:28:49Z2016-07-13T09:49:50Zhttp://eprints.imtlucca.it/id/eprint/1293This item is in the repository with the URL: http://eprints.imtlucca.it/id/eprint/12932012-06-29T12:28:49ZState space c-reductions for concurrent systems in rewriting logicWe present c-reductions, a simple, flexible and very general state space reduction technique that exploits an equivalence relation on states that is a bisimulation. Reduction is achieved by a canonizer function, which maps each state into a not necessarily unique canonical representative of its equivalence class. The approach contains symmetry reduction and name reuse and name abstraction as special cases, and exploits the expressiveness of rewriting logic and its realization in Maude
to automate c-reductions and to seamlessly integrate model checking and the discharging of correctness proof obligations. The performance of the approach has been validated over a set of representative case studies.Alberto Lluch-Lafuentealberto.lluch@imtlucca.itJosé MeseguerAndrea Vandinandrea.vandin@imtlucca.it2011-05-26T09:13:57Z2011-07-11T14:36:25Zhttp://eprints.imtlucca.it/id/eprint/280This item is in the repository with the URL: http://eprints.imtlucca.it/id/eprint/2802011-05-26T09:13:57ZUgo Montanari in a NutshellUgo was born in Besana Brianza in 1943 where his parents had moved to escape from the Milan bombings during the Second World War. Immediately after the war he went back to Milan were he completed all his studies. Ugo got his Laurea degree in Electronic Engineering from the Politecnico di Milano in 1966, three years before the first Laurea curriculum and seventeen years before the first PhD curriculum in Computer Science started in Pisa. Rocco De Nicolar.denicola@imtlucca.itPierpaolo DeganoJosé Meseguer